Vehicle routing and path planning

Abstract

A method of determining a path having an ordered set of waypoints to be visited by a mobile agent to accomplish a mission includes: producing candidate paths using a multi-objective optimization algorithm, subject to a path production heuristic; selecting a path from the candidate paths, subject to a path selection heuristic; instructing the mobile agent to move according to the selected path; modifying a maintained subset of the candidate paths to produce a new candidate path using the algorithm and subject to the path production heuristic; designating either the currently-selected path or the new candidate path as the newly-selected path, subject to the path selection heuristic; and instructing the mobile agent to move according to the newly-selected path. The method may further include iterating production of new candidate paths, either randomly or based on modifications of previous candidate paths, to continually update an operation plan for the mobile agent.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS [0001] This application incorporates by reference in entirety, and claims priority to and benefit of, U.S. Provisional Patent Application No. 60 / 555,778, filed on 24 Mar. 2004.BACKGROUND [0002] Technologies for the control of unmanned ground vehicles (UGVs) attempting to perform local path navigation while traversing unknown, off-road terrains permit simple longer-range path planning, such as navigation between human-specified waypoints. However, these technologies have yet to develop automated plan generation strategies toward achieving higher-level mission goals (e.g., reconnaissance, surveillance, and target acquisition) in light of changing environmental conditions, evolving mission requirements, and a desire or need to coordinate movement of multiple vehicles. [0003] Approaches that have been used to address path planning and routing have included traditional artificial intelligence (Al) algorithms. For example, classical planning, hierar...

AI Technical Summary

Benefits of technology

[0006] There is a need for improved operation planning systems and methods for one or more mobile agents that incorporate any combination of deliberative and reactive planning strategies. The systems and methods described herein are generally directed at, among other things, embodying local as well as global criteria in operation planning (including path planning and routing), yielding global solutions more efficiently and reliably, handling a myriad of constraints typically present in various mobile agent operation planning contexts of interest, placing a fair emphasis on balancing workload distribution among members of a fleet of mobile agents, often dynamically, and having sufficient flexibility to incorporate new criteria into, remove existing criteria from, or reorder priorities in, an operation plan design process. In one embodiment, the systems and methods disclosed herein employ a domain-specific multi-objective optimization algorithm, such as, without limitation, a context-influenced genetic algorithm, to dynamically determine paths for one or more mobile agents to accomplish one or more mission goals; a path may include instructions on traversing at least a portion thereof.

Problems solved by technology

However, these technologies have yet to develop automated plan generation strategies toward achieving higher-level mission goals (e.g., reconnaissance, surveillance, and target acquisition) in light of changing environmental conditions, evolving mission requirements, and a desire or need to coordinate movement of multiple vehicles.

However, the problem of interest is essentially numeric, and hence less suited for reasoning about goals and sub-goals.

Although Al planning techniques may be applied to a higher-level strategic planning problem—i.e., how to decide what the mission goals are—their utility is diminished in the context of tactical planning problems wherein the mission goals are already known.

In many contexts, there is so much space compared to the number of vehicles that the probability of collision is slim.

Yet other multi-robot planning algorithms are primarily concerned with formations and moving of vehicles in unison, and not on balanced workload distribution.

Investigations into coordinating robot behavior by dividing the workload have generally been reactive (local) rather than deliberative (global), losing the benefits of planning ahead for multiple goals.

Furthermore, when assigning goals, path planning is treated as a separate problem, thus substantially ignoring an enemy or obstacle between a vehicle / robot and a nearby goal point.

This approach, however, does not accommodate as many criteria and as much information, at the deliberative planning level, that are generally at play, when determining mission assignments and paths that are not fooled by local gradients.

Images