Formation movement is vital to preserve security among its units during military operations. We plan movement of a military formation over real, or simulated terrain, maximally preserving the relative positions of units in formation while it avoids barriers, and while its units avoid obstacles. Terrain is divided into homogeneous cells (say, squares), and a pair of neighboring cells is adjacent if the formation can transit between these cells while avoiding barriers with sufficient clearance. We induce a graph from these adjacencies, and determine the movement cost on each arc with a fine time-step simulation that finds local movement vectors to preserve relative formation position while avoiding approach too close to barriers or obstacles (this emulates solving differential equations with Euler's method). We then nominate an origin and a destination, select a shortest path, and repeat the time-step simulation over this path to determine the individual positions of each unit as the formation makes its transit. Game designers and robot controllers have published schemes to guide formation movement, but their movements can penetrate barriers, and myopically get caught in cul-de-sacs. By contrast, we guarantee that if a path exists that avoids these pitfalls, we will find it.
| Identifer | oai:union.ndltd.org:nps.edu/oai:calhoun.nps.edu:10945/2174 |
| Date | 06 1900 |
| Creators | Cesur, Fatih. |
| Contributors | Brown, Gerald G., Roland, Ellen F., Naval Postgraduate School, Operations Research |
| Publisher | Monterey, California. Naval Postgraduate School |
| Source Sets | Naval Postgraduate School |
| Detected Language | English |
| Type | Thesis |
| Format | xvi, 41 p. : ill. (some col.) ;, application/pdf |
| Rights | Approved for public release, distribution unlimited |
Page generated in 0.0017 seconds