Please use this identifier to cite or link to this item:
|Title:||Tactical multi-unit pathplanning with GCLS||Authors:||Nareyek, A.
|Issue Date:||2011||Citation:||Nareyek, A.,Goenawan, A.K. (2011). Tactical multi-unit pathplanning with GCLS. Proceedings of the 7th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2011 : 176-181. ScholarBank@NUS Repository.||Abstract:||In this paper, we are considering advanced pathplanning problems that feature finding paths for multiple units subject to rich path constraints. Examples of richer constraints are the following of other units or to stay out of sight of a specific unit. Little attention has so far been given to richer pathplanning problem where the objective is more than reaching a specific destination from a starting point such that the path length is minimized. Richer pathplanning problems occur in many complex real-world scenarios, ranging from computer games to military movement planning. In this paper, a novel way to formally specify such problems and a new local-search strategy to solve such problems are proposed and demonstrated by a prototype implementation. Among the design goals are real-time computability as well as extendibility for new constraints and search heuristics. Copyright © 2011, Association for the Advancement of Artificial.||Source Title:||Proceedings of the 7th AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2011||URI:||http://scholarbank.nus.edu.sg/handle/10635/71935||ISBN:||9781577355397|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 30, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.