By Topic

K2: an efficient approximation algorithm for globally and locally multiply-constrained planning problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Perez-Bergquist, A.S. ; Robotics Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Stentz, A.

Many problems are easily expressed as an attempt to fulfill some goal while laboring under some set of constraints. Prior planning algorithms have addressed this in part, but there are few fast ways of working with more than just a few constraints. Extending algorithms designed for one constraint to multiple constraints is difficult due to the NP complete nature of the problem, prompting a switch to an approximation algorithm. This paper presents K2, a multiply-constrained planning algorithm which is an amalgamation of parts of H_MCOP and Focussed D*. It accepts additive constraints over the path or over any fixed length section of the path. K2 operates quickly and produces results of acceptable quality.

Published in:

Intelligent Robots and Systems, 2005. (IROS 2005). 2005 IEEE/RSJ International Conference on

Date of Conference:

2-6 Aug. 2005