Multiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles

Cited 8 time in webofscience Cited 0 time in scopus
  • Hit : 363
  • Download : 8
DC FieldValueLanguage
dc.contributor.authorHan, Du-Hyunko
dc.contributor.authorKim, Yeong-Daeko
dc.contributor.authorLee, Ju Yongko
dc.date.accessioned2014-09-01T07:15:10Z-
dc.date.available2014-09-01T07:15:10Z-
dc.date.created2014-06-03-
dc.date.created2014-06-03-
dc.date.issued2014-05-
dc.identifier.citationCOMPUTERS & INDUSTRIAL ENGINEERING, v.71, pp.57 - 69-
dc.identifier.issn0360-8352-
dc.identifier.urihttp://hdl.handle.net/10203/189195-
dc.description.abstractWe consider a multiple-criterion shortest path problem with resource constraints, in which one needs to find paths between two points in a terrain for the movement of an unmanned combat vehicle (UCV). In the path planning problem considered here, cumulative traverse time of the UCV, risk level, and (communication) jamming level associated with the paths are limited to be less than or equal to given limits. We propose a modified label-correcting algorithm with a new label-selection strategy to find Pareto-optimal solutions for the multiple objectives of minimizing the traverse time, risk level, and jamming level related to the paths. In addition, we develop a path planning algorithm based on the label-correcting method to solve problems with a single objective within a reasonably short time. For evaluation of the performance of the proposed algorithms, computational experiments are performed on a number of instances, and results show that the proposed algorithms perform better than existing methods in terms of a computation time.-
dc.languageEnglish-
dc.publisherPERGAMON-ELSEVIER SCIENCE LTD-
dc.subjectROUTING PROBLEM-
dc.subjectRESOURCE CONSTRAINTS-
dc.subjectTIME WINDOWS-
dc.subjectOPTIMIZATION-
dc.subjectNETWORKS-
dc.titleMultiple-criterion shortest path algorithms for global path planning of unmanned combat vehicles-
dc.typeArticle-
dc.identifier.wosid000335103700007-
dc.identifier.scopusid2-s2.0-84896926025-
dc.type.rimsART-
dc.citation.volume71-
dc.citation.beginningpage57-
dc.citation.endingpage69-
dc.citation.publicationnameCOMPUTERS & INDUSTRIAL ENGINEERING-
dc.identifier.doi10.1016/j.cie.2014.02.013-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorKim, Yeong-Dae-
dc.contributor.nonIdAuthorHan, Du-Hyun-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorMultiple-criterion shortest path problem-
dc.subject.keywordAuthorGlobal path planning-
dc.subject.keywordAuthorLabel-correcting algorithm-
dc.subject.keywordAuthorPareto-optimal solutions-
dc.subject.keywordPlusROUTING PROBLEM-
dc.subject.keywordPlusRESOURCE CONSTRAINTS-
dc.subject.keywordPlusTIME WINDOWS-
dc.subject.keywordPlusOPTIMIZATION-
dc.subject.keywordPlusNETWORKS-
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 8 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0