{"id":"https://openalex.org/W2057598075","doi":"https://doi.org/10.1109/cisda.2012.6291538","title":"Toward optimizing static target search path planning","display_name":"Toward optimizing static target search path planning","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2057598075","doi":"https://doi.org/10.1109/cisda.2012.6291538","mag":"2057598075"},"language":"en","primary_location":{"id":"doi:10.1109/cisda.2012.6291538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisda.2012.6291538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Symposium on Computational Intelligence for Security and Defence Applications","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028397083","display_name":"Nassirou Lo","orcid":null},"institutions":[{"id":"https://openalex.org/I162787360","display_name":"Institut National d'Optique","ror":"https://ror.org/00702wg16","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I162787360"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nassirou Lo","raw_affiliation_strings":["T-OptLogic Limited, Quebec, Canada","T-OptLogic Ltd. Quebec City, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"T-OptLogic Limited, Quebec, Canada","institution_ids":["https://openalex.org/I162787360"]},{"raw_affiliation_string":"T-OptLogic Ltd. Quebec City, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062247508","display_name":"Jean Berger","orcid":"https://orcid.org/0000-0001-5885-9254"},"institutions":[{"id":"https://openalex.org/I1297460800","display_name":"Defence Research and Development Canada","ror":"https://ror.org/00hgy8d33","country_code":"CA","type":"government","lineage":["https://openalex.org/I1297460800","https://openalex.org/I1336338359","https://openalex.org/I2802286613"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jean Berger","raw_affiliation_strings":["DRDC-Valcartier, Quebec, Canada","DRDC Valcartier, Quebec City, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DRDC-Valcartier, Quebec, Canada","institution_ids":["https://openalex.org/I1297460800"]},{"raw_affiliation_string":"DRDC Valcartier, Quebec City, Canada#TAB#","institution_ids":["https://openalex.org/I1297460800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070464202","display_name":"Martin No\u00ebl","orcid":"https://orcid.org/0000-0003-4431-7715"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]},{"id":"https://openalex.org/I200745827","display_name":"Universit\u00e9 T\u00c9LUQ","ror":"https://ror.org/007y6q934","country_code":"CA","type":"education","lineage":["https://openalex.org/I200745827","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Martin Noel","raw_affiliation_strings":["TELUQ, UQAM, Quebec, Canada","UQAM, TELUQ, Quebec City, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TELUQ, UQAM, Quebec, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I200745827"]},{"raw_affiliation_string":"UQAM, TELUQ, Quebec City, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I200745827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6768,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.69957754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7596244215965271},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6107126474380493},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5813311338424683},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5535517334938049},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5271919369697571},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49429941177368164},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47158634662628174},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.46380212903022766},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43903061747550964},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3090994954109192},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10259917378425598}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7596244215965271},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6107126474380493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5813311338424683},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5535517334938049},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5271919369697571},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49429941177368164},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47158634662628174},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.46380212903022766},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43903061747550964},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3090994954109192},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10259917378425598},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cisda.2012.6291538","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisda.2012.6291538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Symposium on Computational Intelligence for Security and Defence Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W55688194","https://openalex.org/W101508493","https://openalex.org/W274427135","https://openalex.org/W1867051140","https://openalex.org/W1964092601","https://openalex.org/W1984142532","https://openalex.org/W1987736941","https://openalex.org/W1989587773","https://openalex.org/W2007231811","https://openalex.org/W2017136493","https://openalex.org/W2031168329","https://openalex.org/W2105848344","https://openalex.org/W2135598790","https://openalex.org/W2139177468","https://openalex.org/W2140229973","https://openalex.org/W2142473881","https://openalex.org/W2146162130","https://openalex.org/W2148101643","https://openalex.org/W2150658022","https://openalex.org/W2166177494","https://openalex.org/W2597676229","https://openalex.org/W4242811155","https://openalex.org/W6610019448"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560","https://openalex.org/W2011675579","https://openalex.org/W4285278887"],"abstract_inverted_index":{"Discrete":[0],"static":[1,65],"open-loop":[2],"target":[3],"search":[4,66,79],"path":[5,67],"planning":[6,68],"is":[7,100],"known":[8],"to":[9,30,60,77,91,102,177],"be":[10,150],"a":[11,45,71,78,133,178],"NP":[12],"(non-deterministic":[13],"polynomial)":[14],"-":[15],"Hard":[16],"problem,":[17],"and":[18,53,80,108],"problem-solving":[19,56],"methods":[20],"proposed":[21,59,112],"so":[22],"far":[23],"rely":[24],"on":[25,137],"heuristics":[26],"with":[27,145],"no":[28],"way":[29],"properly":[31],"assess":[32],"solution":[33,138],"quality":[34,139],"for":[35,119,129],"practical":[36],"size":[37],"problems.":[38],"Departing":[39],"from":[40],"traditional":[41],"nonlinear":[42],"model":[43],"frameworks,":[44],"new":[46],"integer":[47],"linear":[48],"programming":[49,142],"(ILP)":[50],"exact":[51],"formulation":[52],"an":[54],"approximate":[55],"method":[57],"are":[58],"near-optimally":[61],"solve":[62],"the":[63,83,130,165,168],"discrete":[64],"problem":[69,172],"involving":[70],"team":[72],"of":[73,87,95,167],"homogeneous":[74],"agents.":[75],"Applied":[76],"rescue":[81],"setting,":[82],"approach":[84,114,169],"takes":[85],"advantage":[86],"objective":[88],"function":[89],"separability":[90],"efficiently":[92,151],"maximize":[93],"probability":[94],"success.":[96],"A":[97],"network":[98],"representation":[99],"exploited":[101],"simplify":[103],"modeling,":[104],"reduce":[105],"constraint":[106],"specification":[107],"speed-up":[109],"problem-solving.":[110],"The":[111],"ILP":[113],"rapidly":[115],"yields":[116],"near-optimal":[117],"solutions":[118],"realistic":[120],"problems":[121],"using":[122],"parallel":[123],"processing":[124],"CPLEX":[125],"technology,":[126],"while":[127,174],"providing":[128],"first":[131],"time":[132,147],"robust":[134],"upper":[135],"bound":[136],"through":[140,153],"Lagrangean":[141],"relaxation.":[143],"Problems":[144],"large":[146],"horizons":[148],"may":[149],"solved":[152],"multiple":[154],"fast":[155],"subproblem":[156],"optimizations":[157],"over":[158,170],"receding":[159],"horizons.":[160],"Computational":[161],"results":[162],"clearly":[163],"show":[164],"value":[166],"various":[171],"instances":[173],"comparing":[175],"performance":[176],"myopic":[179],"heuristic.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}