Parallel Planning in Partitioned Problem Spaces (bibtex)

by Balakirsky, Stephen and Herzog, Otthein

Abstract:

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.

View PDF

Reference:

Balakirsky, Stephen and Herzog, Otthein, "Parallel Planning in Partitioned Problem Spaces", In 5th IFAC Symposium on Intelligent Autonomous Vehicles, Elsevier, 2004.

Bibtex Entry:

@INPROCEEDINGS{Balakirsky2005a,
  author = {Balakirsky, Stephen and Herzog, Otthein},
  title = {Parallel Planning in Partitioned Problem Spaces},
  booktitle = {5th IFAC Symposium on Intelligent Autonomous Vehicles},
  year = {2004},
  month = {July5--7},
  publisher = {Elsevier},
  abstract = {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.},
  owner = {pmania},
  timestamp = {2012.11.06},
  url = {http://www-agki.tzi.de/grp/ag-ki/download/2004/balakirsky{\_}herzog04.pdf}
}