The formulation of planning as heuristic search with heuristics derived from problem representations has turned out to be a fruitful approach for classical planning. In this paper...
—This paper introduces a new algorithm for probabilistic motion planning in arbitrary, uncertain vector fields, with emphasis on high-level planning for Montgolfier´e balloons...
Michael T. Wolf, Lars Blackmore, Yoshiaki Kuwata, ...
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...
We present an online algorithm for planning sequences of footstep locations that encode goal-directed navigation strategies for humanoid robots. Planning footsteps is more general...
James J. Kuffner Jr., Satoshi Kagami, Koichi Nishi...