Rational Handling of Multiple Goals for Mobile Robots

Richard Goodwin and Reid Simmons
Tech. Report, CMU-CS-93-204, Computer Science Department, Carnegie Mellon University, October, 1993

View Publication

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.


The mobile robot planning domain is dynamic, with goals becoming active asynchronously. In order to successfully operate in this environment, a robot must be able to interrupt and reformulate its plan of action on-the-fly. This report investigates a method for incorporating the accomplishment of a new goal into a partially executed plan. A decision theoretic approach using net present value as the decision criterion serves as the basis for determining goal ordering dynamically. The appropriateness of net present value over other criteria is argued. The approach has been implemented on a robot operating in an office setting. Examples from this domain and a planetary exploration domain are used to show the advantages of the approach with respect to fixed priority and heuristic approaches.

author = {Richard Goodwin and Reid Simmons},
title = {Rational Handling of Multiple Goals for Mobile Robots},
year = {1993},
month = {October},
institution = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-CS-93-204},
} 2017-09-13T10:51:37-04:00