TZI Literaturverzeichnis

WIKINDX Resources

Proceedings Article: BibTeX citation key:  Balakirsky2005a
S. Balakirsky and O. Herzog, "Parallel Planning in Partitioned Problem Spaces" in 5th IFAC Symposium on Intelligent Autonomous Vehicles, July 5-7, 2004,
Last edited by: Jan D. Gehrke 2008-05-22 12:36:12
Categories: AG-KI, Contribution to conferences-reviewed, IS
Creators: Balakirsky, Herzog
Collection: 5th IFAC Symposium on Intelligent Autonomous Vehicles

Number of views:  1501
Popularity index:  70.01%

This paper presents a complete and optimal framework for extending basic graph planning to operate in partitioned problem spaces. These spaces typically occur in systems that implement a hierarchy or contain data of various resolutions. An algorithm for the framework will be presented along with a proof of optimality. Finally, an example implementation for mobile robot path planning will be discussed.
Last edited by: Jan D. Gehrke

Further information may be found at:

wikindx      |     Total Resources:  3135     |     Database queries:  34     |     Script execution:  0.45029 secs