{"id":"https://openalex.org/W3092499619","doi":"https://doi.org/10.1109/case48305.2020.9217046","title":"Informed Sampling-Based Motion Planning for Manipulating Multiple Micro Agents using Global External Fields","display_name":"Informed Sampling-Based Motion Planning for Manipulating Multiple Micro Agents using Global External Fields","publication_year":2020,"publication_date":"2020-08-01","ids":{"openalex":"https://openalex.org/W3092499619","doi":"https://doi.org/10.1109/case48305.2020.9217046","mag":"3092499619"},"language":"en","primary_location":{"id":"doi:10.1109/case48305.2020.9217046","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9217046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","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/A5100639664","display_name":"Xi-Lin Li","orcid":"https://orcid.org/0000-0002-3853-2702"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xilin Li","raw_affiliation_strings":["Department of Mechanical Engineering, Binghamton University, Binghamton, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Binghamton University, Binghamton, NY, USA","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035243524","display_name":"Kaiyan Yu","orcid":"https://orcid.org/0000-0001-5962-8968"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kaiyan Yu","raw_affiliation_strings":["Department of Mechanical Engineering, Binghamton University, Binghamton, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Binghamton University, Binghamton, NY, USA","institution_ids":["https://openalex.org/I123946342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I123946342"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":null,"first_page":"888","last_page":"893"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9944000244140625,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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.7176067233085632},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.6754238605499268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6713929176330566},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6626014113426208},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5821702480316162},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5647115707397461},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5061349272727966},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4843931794166565},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.48041653633117676},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.41336870193481445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33520781993865967},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2240728735923767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19575542211532593}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7176067233085632},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.6754238605499268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6713929176330566},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6626014113426208},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5821702480316162},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5647115707397461},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5061349272727966},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4843931794166565},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.48041653633117676},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.41336870193481445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33520781993865967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2240728735923767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19575542211532593},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case48305.2020.9217046","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case48305.2020.9217046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","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":17,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1982754184","https://openalex.org/W2084703732","https://openalex.org/W2112271657","https://openalex.org/W2124455817","https://openalex.org/W2132990760","https://openalex.org/W2517993614","https://openalex.org/W2552069129","https://openalex.org/W2765678012","https://openalex.org/W2901957321","https://openalex.org/W2964568892","https://openalex.org/W2990876349","https://openalex.org/W3007000862","https://openalex.org/W4244008682","https://openalex.org/W6766983361"],"related_works":["https://openalex.org/W2083550201","https://openalex.org/W2118356379","https://openalex.org/W2343433574","https://openalex.org/W1678705929","https://openalex.org/W2094354888","https://openalex.org/W2154905206","https://openalex.org/W1968478252","https://openalex.org/W2099424261","https://openalex.org/W2970423998","https://openalex.org/W3128677426"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"novel":[5,51],"motion":[6],"planning":[7],"algorithms,":[8,101],"Bi-iSST":[9,39],"and":[10,109],"Ref-iSST,":[11],"to":[12,44,56,72,92,98,111,116],"quickly":[13,73,105],"generate":[14,74],"time-optimal":[15],"trajectories":[16,76],"for":[17],"multiple":[18,125],"agents":[19,127],"sharing":[20],"global":[21,129],"external":[22,130],"fields.":[23,131],"Both":[24],"algorithms":[25,104],"are":[26],"extended":[27],"by":[28,61,86],"the":[29,41,47,69,81,93,99,102,118,121],"stable":[30],"sparse":[31],"rapidly-exploring":[32],"random":[33],"tree":[34],"kinodynamic":[35],"motion-planning":[36],"algorithm.":[37],"The":[38,66],"uses":[40,68],"bidirectional":[42],"approach":[43],"speed":[45],"up":[46],"searching":[48],"process.":[49],"A":[50],"connection":[52],"process":[53,83],"is":[54],"proposed":[55,103],"connect":[57],"two":[58],"trees":[59],"efficiently":[60],"applying":[62],"an":[63],"optimization":[64],"procedure.":[65],"Ref-iSST":[67],"workspace":[70],"information":[71],"global-routing":[75,94],"as":[77],"references,":[78],"then":[79],"guides":[80],"search":[82],"more":[84,88],"effectively":[85],"getting":[87],"accurate":[89],"heuristics":[90],"according":[91],"reference":[95],"trajectory.":[96],"Compared":[97],"state-of-the-art":[100],"update":[106],"feasible":[107],"solutions":[108],"converge":[110],"a":[112],"near-optimal,":[113],"minimum-time":[114],"solution":[115],"increase":[117],"efficiency":[119],"of":[120,124],"simultaneous":[122],"manipulation":[123],"micro":[126],"using":[128]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}