Planning with Pinch Points
Tech. Report, CMU-RI-TR-04-06, Robotics Institute, Carnegie Mellon University, 2004
Abstract
We describe a heuristic search algorithm for generating optimal plans in a new class of decision problem, characterised by the incorporation of hidden state. The approach exploits the nature of the hidden state to reduce the state space by orders of magnitude. It then interleaves AO*-type heuristic expansion of the reduced space with forwards and backwards propagation phases to produce a solution in a fraction of the time required by other techniques. Results are provided on an outdoor path planning application.
BibTeX
@techreport{Ferguson-2004-8844,author = {David Ferguson and Anthony (Tony) Stentz and Sebastian Thrun},
title = {Planning with Pinch Points},
year = {2004},
month = {January},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-04-06},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.