Please use this identifier to cite or link to this item: https://doi.org/10.1109/CIG.2009.5286454
DC FieldValue
dc.titleMulti-unit tactical pathplanning
dc.contributor.authorWang, H.
dc.contributor.authorMalik, O.N.
dc.contributor.authorNareyek, A.
dc.date.accessioned2014-06-19T03:19:31Z
dc.date.available2014-06-19T03:19:31Z
dc.date.issued2009
dc.identifier.citationWang, 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. <a href="https://doi.org/10.1109/CIG.2009.5286454" target="_blank">https://doi.org/10.1109/CIG.2009.5286454</a>
dc.identifier.isbn9781424448159
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/71072
dc.description.abstractThe 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/CIG.2009.5286454
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/CIG.2009.5286454
dc.description.sourcetitleCIG2009 - 2009 IEEE Symposium on Computational Intelligence and Games
dc.description.page349-354
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Dec 6, 2022

Page view(s)

96
checked on Dec 8, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.