{"id":"https://openalex.org/W3002166437","doi":"https://doi.org/10.1080/01605682.2019.1685362","title":"Near-optimal search-and-rescue path planning for a moving target","display_name":"Near-optimal search-and-rescue path planning for a moving target","publication_year":2020,"publication_date":"2020-01-27","ids":{"openalex":"https://openalex.org/W3002166437","doi":"https://doi.org/10.1080/01605682.2019.1685362","mag":"3002166437"},"language":"en","primary_location":{"id":"doi:10.1080/01605682.2019.1685362","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2019.1685362","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"type":"article","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/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":"funder","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"],"affiliations":[{"raw_affiliation_string":"DRDC Valcartier, Quebec, Canada","institution_ids":["https://openalex.org/I1297460800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103188419","display_name":"Mohamed Barkaoui","orcid":"https://orcid.org/0000-0002-9205-7391"},"institutions":[{"id":"https://openalex.org/I179097149","display_name":"University of Carthage","ror":"https://ror.org/057x6za15","country_code":"TN","type":"education","lineage":["https://openalex.org/I179097149"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Mohamed Barkaoui","raw_affiliation_strings":["Carthage University, Faculty of Sciences of Bizerte, Bizerte, Tunisia"],"affiliations":[{"raw_affiliation_string":"Carthage University, Faculty of Sciences of Bizerte, Bizerte, Tunisia","institution_ids":["https://openalex.org/I179097149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028397083","display_name":"Nassirou Lo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nassirou Lo","raw_affiliation_strings":["SATWII Solutions Inc, Quebec, Canada"],"affiliations":[{"raw_affiliation_string":"SATWII Solutions Inc, Quebec, Canada","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103188419"],"corresponding_institution_ids":["https://openalex.org/I179097149"],"apc_list":null,"apc_paid":null,"fwci":0.0977,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.35536398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"72","issue":"3","first_page":"688","last_page":"700"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6985363364219666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6165623068809509},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5644916892051697},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5560187101364136},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4889191687107086},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.473865270614624},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4198690950870514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2715347707271576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2523730993270874},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1672177016735077}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6985363364219666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6165623068809509},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5644916892051697},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5560187101364136},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4889191687107086},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.473865270614624},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4198690950870514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2715347707271576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2523730993270874},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1672177016735077},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01605682.2019.1685362","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2019.1685362","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/13","score":0.44999998807907104,"display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W40650588","https://openalex.org/W77889016","https://openalex.org/W274427135","https://openalex.org/W1966283062","https://openalex.org/W1969839206","https://openalex.org/W1984142532","https://openalex.org/W2002939362","https://openalex.org/W2008220096","https://openalex.org/W2017136493","https://openalex.org/W2031168329","https://openalex.org/W2038435222","https://openalex.org/W2042189440","https://openalex.org/W2047235079","https://openalex.org/W2057598075","https://openalex.org/W2065549538","https://openalex.org/W2074476042","https://openalex.org/W2077042172","https://openalex.org/W2118038919","https://openalex.org/W2119064581","https://openalex.org/W2129084883","https://openalex.org/W2135885868","https://openalex.org/W2140229973","https://openalex.org/W2171362124","https://openalex.org/W2335715504","https://openalex.org/W2507371836","https://openalex.org/W2571371005","https://openalex.org/W2597676229","https://openalex.org/W2728860753","https://openalex.org/W2807420905","https://openalex.org/W2884243185","https://openalex.org/W2898179042","https://openalex.org/W4255222144","https://openalex.org/W4255876483","https://openalex.org/W4301378748","https://openalex.org/W6735096356"],"related_works":["https://openalex.org/W2359600231","https://openalex.org/W3216757130","https://openalex.org/W2380019117","https://openalex.org/W2126380264","https://openalex.org/W2093343611","https://openalex.org/W2011675579","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612"],"abstract_inverted_index":{"Discrete":[0],"search":[1,55,91],"and":[2,36,187,201],"rescue":[3],"path":[4,56,92,116],"planning":[5,57,93],"for":[6,20,59,174,199],"a":[7,46,60,71,78,88],"moving":[8,61],"target":[9,29],"problem":[10,58,69,94,122,140,205],"is":[11,23,50,74,132,181],"computationally":[12],"hard.":[13],"Despite":[14],"heuristic":[15],"methods":[16],"proposed":[17,51],"so":[18],"far,":[19],"which":[21,143],"efficiency":[22],"further":[24,182],"plagued":[25],"by":[26,135],"random":[27],"episodic":[28],"kinematic":[30],"behavior,":[31],"qualifying":[32],"real":[33],"solution":[34,117,166],"goodness":[35],"specifying":[37],"optimality":[38],"gap":[39],"still":[40],"remain":[41],"elusive.":[42],"In":[43],"this":[44],"paper":[45],"new":[47],"alternate":[48],"formulation":[49],"to":[52,76,99,108,148,184],"solve":[53,77],"the":[54,67,120,138,146,159,194,197],"target.":[62],"Rather":[63],"than":[64],"tackling":[65],"explicitly":[66],"original":[68],"model,":[70],"remarkable":[72],"property":[73,142],"exploited":[75],"conjugate":[79,121],"mixed-integer":[80],"linear":[81],"programming":[82],"problem.":[83],"The":[84],"approach":[85,198],"lies":[86],"on":[87],"compact":[89],"open-loop":[90],"model":[95],"with":[96],"anticipated":[97],"feedback":[98],"efficiently":[100],"minimize":[101],"probability":[102,112],"of":[103,113,137,153,196],"detection":[104],"failure":[105],"as":[106],"opposed":[107],"traditionally":[109],"maximize":[110],"cumulative":[111],"success.":[114],"Preserving":[115],"optimality,":[118],"solving":[119],"proves":[123],"very":[124],"valuable":[125],"in":[126,151,171],"significantly":[127],"reducing":[128],"computational":[129],"complexity.":[130],"This":[131],"mainly":[133],"achievable":[134],"virtue":[136],"resulting":[139],"objective":[141],"concisely":[144],"defines":[145],"function":[147],"be":[149],"minimized":[150],"terms":[152],"terminal":[154],"belief":[155],"contributions":[156],"only.":[157],"For":[158],"first":[160],"time":[161,173],"optimal":[162],"or":[163],"upper":[164],"bound":[165],"computation":[167],"are":[168],"made":[169],"possible":[170],"reasonable":[172],"practical":[175],"size":[176],"problems.":[177],"A":[178],"network":[179],"representation":[180],"utilized":[183],"simplify":[185],"modeling":[186],"facilitate":[188],"constraint":[189],"specification.":[190],"Computational":[191],"results":[192],"show":[193],"strength":[195],"one":[200],"two":[202],"searching":[203],"agent":[204],"instances.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}