{"id":"https://openalex.org/W1971331422","doi":"https://doi.org/10.1109/icra.2012.6224707","title":"Stochastic motion planning with path constraints and application to optimal agent, resource, and route planning","display_name":"Stochastic motion planning with path constraints and application to optimal agent, resource, and route planning","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W1971331422","doi":"https://doi.org/10.1109/icra.2012.6224707","mag":"1971331422"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2012.6224707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224707","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-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/A5072506078","display_name":"Sejoon Lim","orcid":"https://orcid.org/0000-0003-1917-699X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sejoon Lim","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066830185","display_name":"Daniela Rus","orcid":"https://orcid.org/0000-0001-5473-3566"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniela Rus","raw_affiliation_strings":["Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Computer Science and Artificial Intelligence Lab, MIT, Cambridge, MA 02139, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4966,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90609652,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/motion-planning","display_name":"Motion planning","score":0.7503982782363892},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7181745767593384},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.705611526966095},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5984472036361694},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5769228339195251},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5445778965950012},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5277101397514343},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5022399425506592},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.47857025265693665},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4305099546909332},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.22853830456733704},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21293142437934875},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19913092255592346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1521429419517517},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12032046914100647},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09719103574752808},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0778769850730896}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7503982782363892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7181745767593384},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.705611526966095},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5984472036361694},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5769228339195251},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5445778965950012},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5277101397514343},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5022399425506592},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.47857025265693665},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4305099546909332},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.22853830456733704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21293142437934875},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19913092255592346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1521429419517517},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12032046914100647},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09719103574752808},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0778769850730896},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"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.1109/icra.2012.6224707","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224707","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W311217234","https://openalex.org/W1506734247","https://openalex.org/W1530547402","https://openalex.org/W1604276976","https://openalex.org/W1976699101","https://openalex.org/W2001158995","https://openalex.org/W2016049811","https://openalex.org/W2029341065","https://openalex.org/W2030998569","https://openalex.org/W2039114216","https://openalex.org/W2068851130","https://openalex.org/W2070361724","https://openalex.org/W2081287319","https://openalex.org/W2104459870","https://openalex.org/W2119702428","https://openalex.org/W2122967662","https://openalex.org/W2123784360","https://openalex.org/W2125916239","https://openalex.org/W2185382382","https://openalex.org/W2987174194","https://openalex.org/W4243529478","https://openalex.org/W6631566212","https://openalex.org/W6636025607","https://openalex.org/W6667746989","https://openalex.org/W6678504297"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"We":[0,139],"present":[1],"algorithms":[2,37],"for":[3,7,20,44,53],"a":[4,50,66,82,111,144],"motion":[5,95],"planning":[6,96],"multiple":[8,15,70,72,75],"agents":[9],"whose":[10],"goals":[11],"are":[12,79],"to":[13,64,88],"visit":[14,60],"locations":[16],"with":[17,59,69],"probabilistic":[18],"guarantees":[19],"achieving":[21],"the":[22,35,40,54,101,108,123,126,133,141,152],"goal.":[23],"Though":[24],"much":[25],"research":[26],"has":[27],"been":[28],"done":[29],"in":[30,119],"stochastic":[31,55],"shortest":[32,56],"path":[33,57,109],"algorithms,":[34],"existing":[36],"focus":[38],"on":[39],"single-origin":[41,134],"single-destination":[42,135],"problem":[43,58,97,124,136],"one":[45],"agent.":[46],"This":[47],"paper":[48,121],"formulates":[49],"general":[51],"framework":[52],"node":[61],"constraints":[62,78],"designed":[63],"achieve":[65],"specific":[67],"goal":[68],"agents,":[71,103],"resources,":[73,104],"and":[74,105,107,150],"destinations.":[76],"The":[77,117],"defined":[80],"by":[81,137,143],"set":[83],"of":[84,86,99,113,129],"sequences":[85],"nodes":[87,114],"be":[89],"visited.":[90],"Given":[91],"predetermined":[92],"constraints,":[93],"our":[94],"consists":[98],"finding":[100],"best":[102],"destinations,":[106],"through":[110],"sequence":[112],"representing":[115],"them.":[116],"technique":[118],"this":[120],"solves":[122],"at":[125],"same":[127],"level":[128],"complexity":[130],"as":[131],"solving":[132],"parallelization.":[138],"demonstrate":[140],"algorithm":[142],"Web-based":[145],"traffic":[146],"navigation":[147],"guide":[148],"system":[149],"evaluate":[151],"algorithm's":[153],"performance.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}