Sciweavers

Share
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
10 years 24 days ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
10 years 24 days ago
Motion Planning for a Class of Planar Closed-chain Manipulators
— We study the motion planning problem for planar star-shaped manipulators. These manipulators are formed by joining k “legs” to a common point (like the thorax of an insect)...
Guanfeng Liu, Jeffrey C. Trinkle, N. Shvalb
SARA
2007
Springer
10 years 27 days ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
MATES
2007
Springer
10 years 28 days ago
Coordinating Competitive Agents in Dynamic Airport Resource Scheduling
In real-life multi-agent planning problems, long-term plans will often be invalidated by changes in the environment during or after the planning process. When this happens, short-t...
Xiaoyu Mao, Adriaan ter Mors, Nico Roos, Cees Witt...
SARA
2009
Springer
10 years 1 months ago
Reformulating Planning Problems by Eliminating Unpromising Actions
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...
Lukás Chrpa, Roman Barták
books