{"id":"https://openalex.org/W4415251555","doi":"https://doi.org/10.48550/arxiv.2509.19168","title":"A Multimodal Stochastic Planning Approach for Navigation and Multi-Robot Coordination","display_name":"A Multimodal Stochastic Planning Approach for Navigation and Multi-Robot Coordination","publication_year":2025,"publication_date":"2025-09-23","ids":{"openalex":"https://openalex.org/W4415251555","doi":"https://doi.org/10.48550/arxiv.2509.19168"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.19168","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.19168","pdf_url":"https://arxiv.org/pdf/2509.19168","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.19168","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076783672","display_name":"Mark A. Gonzales","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gonzales, Mark","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037978230","display_name":"Eunsoon Oh","orcid":"https://orcid.org/0000-0001-6187-6864"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oh, Ethan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020715128","display_name":"Joseph Moore","orcid":"https://orcid.org/0000-0003-4678-9994"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moore, Joseph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.91839998960495,"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.91839998960495,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7358999848365784},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7265999913215637},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6919999718666077},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.42260000109672546},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.39629998803138733},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3930000066757202},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.3824000060558319}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7358999848365784},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7265999913215637},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6919999718666077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6891999840736389},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.42260000109672546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40639999508857727},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.39629998803138733},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3930000066757202},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3540000021457672},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3346000015735626},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.3310000002384186},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C2779462738","wikidata":"https://www.wikidata.org/wiki/Q17146409","display_name":"Realisation","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2513999938964844},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.19168","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.19168","pdf_url":"https://arxiv.org/pdf/2509.19168","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.19168","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.19168","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.19168","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.19168","pdf_url":"https://arxiv.org/pdf/2509.19168","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,23,27,72],"receding-horizon,":[6],"sampling-based":[7],"planner":[8],"capable":[9],"of":[10,42,80],"reasoning":[11],"over":[12],"multimodal":[13,24],"policy":[14,25],"distributions.":[15],"By":[16],"using":[17],"the":[18,43,77,106],"cross-entropy":[19],"method":[20],"to":[21,53,59,64,70],"optimize":[22],"under":[26],"common":[28],"cost":[29],"function,":[30],"our":[31,49],"approach":[32,50],"increases":[33],"robustness":[34],"against":[35],"local":[36],"minima":[37],"and":[38,67,97,110],"promotes":[39],"effective":[40],"exploration":[41],"solution":[44],"space.":[45],"We":[46],"show":[47],"that":[48,86],"naturally":[51],"extends":[52],"multi-robot":[54,99],"collision-free":[55],"planning,":[56],"enables":[57],"agents":[58],"share":[60],"diverse":[61],"candidate":[62],"policies":[63],"avoid":[65],"deadlocks,":[66],"allows":[68],"teams":[69],"minimize":[71],"global":[73],"objective":[74],"without":[75],"incurring":[76],"computational":[78],"complexity":[79],"centralized":[81],"optimization.":[82],"Numerical":[83],"simulations":[84],"demonstrate":[85],"employing":[87],"multiple":[88],"modes":[89],"significantly":[90],"improves":[91],"success":[92],"rates":[93],"in":[94,98],"trap":[95],"environments":[96],"collision":[100],"avoidance.":[101],"Hardware":[102],"experiments":[103],"further":[104],"validate":[105],"approach's":[107],"real-time":[108],"feasibility":[109],"practical":[111],"performance.":[112]},"counts_by_year":[],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-16T00:00:00"}
