Please use this identifier to cite or link to this item:
|Title:||Multi-unit tactical pathplanning||Authors:||Wang, H.
|Issue Date:||2009||Citation:||Wang, H.,Malik, O.N.,Nareyek, A. (2009). Multi-unit tactical pathplanning. CIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games : 349-354. ScholarBank@NUS Repository. https://doi.org/10.1109/CIG.2009.5286454||Abstract:||The task of pathfinding has received considerable attention in research as well as practice. Most of the approaches focus on minimizing the length of the path as well as optimizing the efficiency of the algorithm. Less attention has been paid to the problem of incorporating rich global conditions that require more than simply reaching a specific location. In this paper, we analyze elements of richer pathplanning problems, propose an enhanced specification format, and provide a first simple mechanism to solve such problems. ©2009 IEEE.||Source Title:||CIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games||URI:||http://scholarbank.nus.edu.sg/handle/10635/71072||ISBN:||9781424448159||DOI:||10.1109/CIG.2009.5286454|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2022
checked on Sep 22, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.