72 search results - page 6 / 15 » Fast Planning by Search in Domain Transition Graph |
128
click to vote
PUK
2003
15 years 1 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
AIPS
2000
15 years 1 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
ATAL
2009
Springer
15 years 23 days ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
115
click to vote
ROBOCUP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Two main challenges of robot action planning in real domains are uncertain action effects and dynamic environments. In this paper, an instance-based action model is lear...