Integrating a Temporal Planner with a Path Planner for a Mobile Robot

Brigitte Lamare and Malik Ghallab

General planners enable to describe unrestricted classes of planning problems, but have the drawback of being relatively slow when compared to the performance of domain-specific planners within their domains. This slowness proves to be a major handicap when faced with planning and executing in a real world environment. In order to overcome this, we have investigated the idea of using domain-specific planners to assist a general one. We have tested this concept by integrating the general planner LaTeX with a path-finding planner. In our examples, where there are many movements to be planned, the benefits thus obtained are significant. In order to achieve the integration of the two planners, we have exploited LaTeX’s use of an abstraction hierarchy, which enables us to control the planning system formed by the two planners.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.