Context-Aware Route Planning

Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents. Existing approaches either integrate path planning and conflict resolution, or resolve conflicts after a tentative path has been found. For the integrated approach, optimal route planning was long believed to be computationally too expensive. After analysis of the context-aware routing problem, we have been able to develop a much faster optimal algorithm, with which real-time, optimal planning may become a reality. The usability and robustness of any context-aware planning approach requires more research, however. Also, the robustness of a plan must be viewed in the context of a plan execution method, which may be able to solve small conflicts that occur at run-time.

• Type: Journal
• Year: 2010
• Where: MATES
• Authors: Adriaan ter Mors, Cees Witteveen, Jonne Zutt, Fernando A. Kuipers
• Keywords: Context-aware Planning Approach, Context-aware Routing Problem, Intelligent Agents, MATES 2010, Planning