Sciweavers

Share
MIG
2010
Springer

Path Planning for Groups Using Column Generation

11 years 3 months ago
Path Planning for Groups Using Column Generation
In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a dynamic flow problem. If there are several groups with different origins and destinations, then the problem becomes NP-hard. In current games, these problems are solved by using greedy ad hoc rules, leading to long traversal times or congestions and deadlocks near narrow passages. We present a centralized optimization approach based on Integer Linear Programming. Our solution provides an efficient heuristic to minimize the average and latest arrival time of the units.
Marjan van den Akker, Roland Geraerts, Han Hoogeve
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where MIG
Authors Marjan van den Akker, Roland Geraerts, Han Hoogeveen, Corien Prins
Comments (0)
books