Sciweavers

202 search results - page 21 / 41
» Admissible Heuristics for Optimal Planning
Sort
View
CORR
2011
Springer
135views Education» more  CORR 2011»
13 years 3 months ago
Planning with Partial Preference Models
In many real-world planning scenarios, the users are interested in optimizing multiple objectives (such as makespan and execution cost), but are unable to express their exact trad...
Tuan A. Nguyen, Minh Binh Do, Alfonso Gerevini, Iv...
CDC
2010
IEEE
145views Control Systems» more  CDC 2010»
13 years 9 days ago
Cooperative mission planning for a class of carrier-vehicle systems
Abstract— In this work we focus on mission planning problems in scenarios in which a carrier vehicle, typically slow but with virtually infinite range, and a carried vehicle, wh...
Emanuele Garone, Roberto Naldi, Alessandro Casavol...
MIG
2010
Springer
13 years 7 months ago
Path Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...
PVLDB
2008
126views more  PVLDB 2008»
13 years 8 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
ECP
1997
Springer
103views Robotics» more  ECP 1997»
14 years 25 days ago
Plan-Refinement Strategies and Search-Space Size
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
Reiko Tsuneto, Dana S. Nau, James A. Hendler