Nanyang Technological University

The Boeing Company

Singapore Technologies Dynamics Pte Ltd

Singapore Technologies Dynamics Ptd Ltd.

Meng Hiot Lim

Yi Liang Xu

John Lyle Vian

Jung Soon Jang

Matthew Aaron Vavrina

Yew Soon Ong

Caishun Chen

A system and methods for mission re-planning are presented. Vehicles are monitored in real-time, and an incapacitated vehicle from among the vehicles that performs an incomplete task is detected. A remaining coverage set comprising a remaining coverage area for each of the vehicles is determined. A travel distance from a task completion location of each of the vehicles to a stopped point of the incapacitated vehicle is calculated to provide a travel set. An extra coverage set is determined based on the travel set and the remaining coverage set, and an incomplete coverage area for the incomplete task is calculated. The extra coverage set is compared to the incomplete coverage area and the remaining coverage area to provide a sufficiency list, and an assigned vehicle is selected from the vehicles based on the sufficiency list.

Mission re-planning for coordinated multivehicle task allocation

A method and system are presented for configuring a search algorithm for solving a combinatorial optimization problem. The search algorithm has a number of procedural components. Each procedural component is configured using a respective data structure. The data structure has a tree structure, including traversal split nodes, each of which represents a choice to be made when configuring the procedural component of the search algorithm. Configuring the procedural component corresponds to traversing the tree structure, and the traversal is performed automatically. At each of the traversal split nodes, the choice of which direction to take through the tree structure is made randomly, using a respective probabilistic function. Thus, a population of candidate algorithms is generated. These are evaluated, and the probabilistic functions modified.

Method and apparatus for automatic configuration of meta-heuristic algorithms in a problem solving environment

The invention pertains to an algorithm development environment for solving a class of combinatorial optimization problems. Many practical real-life applications can be formulated as combinatorial optimization problems. Over the years, there have been algorithms proposed to solve these problems. The effort in customizing algorithms to fulfill a particular domain-specific application is still significant. Furthermore, conventional approaches towards codes generation and modification are tedious and thus inefficient. To address the need for rapid generation of algorithms that are efficient in solving a given class of real-life problems, embodiments provide a hierarchical tree structure for managing a procedure modules library. Based on the preferred management and object-oriented design concept, users configure and generate a genetic algorithm (GA) via an intuitive graphical user interface. The goal-seeking customization of the generated GA can be easily carried out for solving various optimization problems. This way, the efficiency of algorithm development is enhanced significantly.

Method and apparatus for an algorithm development environment for solving a class of real-life combinatorial optimization problems

Growing community of inventors

Singapore, Singapore

Meng Hiot Lim