{"id":"https://openalex.org/W4321637060","doi":"https://doi.org/10.1109/sisy56759.2022.10036293","title":"Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles","display_name":"Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles","publication_year":2022,"publication_date":"2022-09-15","ids":{"openalex":"https://openalex.org/W4321637060","doi":"https://doi.org/10.1109/sisy56759.2022.10036293"},"language":"en","primary_location":{"id":"doi:10.1109/sisy56759.2022.10036293","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/sisy56759.2022.10036293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics (SISY)","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/A5084627066","display_name":"Yichen Ding","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yichen Ding","raw_affiliation_strings":["Waseda University,Tokyo,Japan","Waseda University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Waseda University,Tokyo,Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100708117","display_name":"Jialong Li","orcid":"https://orcid.org/0000-0003-3416-5551"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jialong Li","raw_affiliation_strings":["Waseda University,Tokyo,Japan","Waseda University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Waseda University,Tokyo,Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045332896","display_name":"Kenji Tei","orcid":"https://orcid.org/0000-0003-1106-1709"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kenji Tei","raw_affiliation_strings":["Waseda University,Tokyo,Japan","Waseda University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Waseda University,Tokyo,Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I150744194"],"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":"000103","last_page":"000108"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9735999703407288,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9733999967575073,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/computer-science","display_name":"Computer science","score":0.7473063468933105},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.7367978692054749},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6331267952919006},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.565504252910614},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5227373242378235},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.518775224685669},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.511031985282898},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.5016875267028809},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4919683635234833},{"id":"https://openalex.org/keywords/prioritization","display_name":"Prioritization","score":0.4579216241836548},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4429042637348175},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3582203984260559},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.33720993995666504},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27119743824005127},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20054882764816284},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17692726850509644},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10932990908622742},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07642614841461182}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7473063468933105},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7367978692054749},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6331267952919006},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.565504252910614},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5227373242378235},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.518775224685669},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.511031985282898},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.5016875267028809},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4919683635234833},{"id":"https://openalex.org/C2777615720","wikidata":"https://www.wikidata.org/wiki/Q11888847","display_name":"Prioritization","level":2,"score":0.4579216241836548},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4429042637348175},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3582203984260559},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.33720993995666504},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27119743824005127},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20054882764816284},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17692726850509644},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10932990908622742},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07642614841461182},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"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/C539667460","wikidata":"https://www.wikidata.org/wiki/Q2414942","display_name":"Management science","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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":2,"locations":[{"id":"doi:10.1109/sisy56759.2022.10036293","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/sisy56759.2022.10036293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics (SISY)","raw_type":"proceedings-article"},{"id":"pmh:oai:t2r2.star.titech.ac.jp:50686563","is_oa":false,"landing_page_url":"http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100908798","pdf_url":null,"source":{"id":"https://openalex.org/S4377196385","display_name":"Tokyo Tech Research Repository (Tokyo Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114531698","host_organization_name":"Tokyo Institute of Technology","host_organization_lineage":["https://openalex.org/I114531698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1832534480","https://openalex.org/W1969483458","https://openalex.org/W1970276631","https://openalex.org/W1998058859","https://openalex.org/W2042865898","https://openalex.org/W2463574373","https://openalex.org/W2809708768","https://openalex.org/W2914296650","https://openalex.org/W2945187433","https://openalex.org/W2947921037","https://openalex.org/W2964997335","https://openalex.org/W2966625830"],"related_works":["https://openalex.org/W2506292322","https://openalex.org/W4283209547","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W3154539612"],"abstract_inverted_index":{"In":[0,23],"the":[1,24,63,84,91],"Multi-Agent":[2],"Path":[3],"Finding":[4],"(MAPF)":[5],"problem,":[6,26],"a":[7,13,30,38,70],"set":[8],"of":[9,87,93],"agents":[10,28,89],"moving":[11,96],"on":[12,37,62,75],"graph":[14],"must":[15],"reach":[16],"their":[17],"respective":[18],"destinations":[19],"without":[20],"inter-agent":[21],"collisions.":[22,100],"MAPF":[25,65],"when":[27],"plan":[29],"route,":[31,40],"they":[32],"compete":[33],"for":[34],"some":[35],"resources":[36],"specific":[39],"and":[41,95],"such":[42],"contention":[43],"sometimes":[44],"causes":[45],"deadlock.":[46],"However,":[47],"unpredictable":[48,94],"obstacles":[49,97],"like":[50],"warehouses":[51],"may":[52],"appear":[53],"in":[54,90],"real":[55],"scenes,":[56],"making":[57],"route":[58],"planning":[59],"difficult.":[60],"Based":[61],"existing":[64],"algorithm,":[66],"this":[67],"paper":[68],"proposes":[69],"new":[71],"algorithm":[72],"that":[73],"relies":[74],"an":[76],"adaptive":[77],"prioritization":[78],"scheme":[79],"to":[80,83],"pay":[81],"effort":[82],"adjacent":[85],"movements":[86],"multiple":[88],"presence":[92],"while":[98],"avoiding":[99]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}