default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeisuke Okumura 0001
Person information
- unicode name: 奥村 圭祐
- affiliation: Tokyo Institute of Technology, School of Computing, Japan
- affiliation: National Institute of Advanced Industrial Science and Technology, Japan
- affiliation: University of Cambridge, UK
Other persons with the same name
- Keisuke Okumura 0002 — Japan Atomic Energy Agency, Iwaki, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j5]Jean-Marc Alkazzi
, Keisuke Okumura:
A Comprehensive Review on Leveraging Machine Learning for Multi-Agent Path Finding. IEEE Access 12: 57390-57409 (2024)- 2023
- [j4]Keisuke Okumura, Xavier Défago:
Solving simultaneous target assignment and path planning efficiently with time-independent execution. Artif. Intell. 321: 103946 (2023) - [j3]Keisuke Okumura, François Bonnet, Yasumasa Tamura, Xavier Défago:
Offline Time-Independent Multiagent Path Planning. IEEE Trans. Robotics 39(4): 2720-2737 (2023) - 2022
- [j2]Keisuke Okumura, Manao Machida, Xavier Défago, Yasumasa Tamura:
Priority inheritance with backtracking for iterative multi-agent path finding. Artif. Intell. 310: 103752 (2022) - 2020
- [j1]Keisuke Okumura, Hiroki Ora, Yoshihiro Miyake:
Investigating the Hand Ownership Illusion With Two Views Merged in. Frontiers Robotics AI 7: 49 (2020)
Conference and Workshop Papers
- 2024
- [c14]Keisuke Okumura:
Engineering LaCAM*: Towards Real-time, Large-scale, and Near-optimal Multi-agent Pathfinding. AAMAS 2024: 1501-1509 - 2023
- [c13]Keisuke Okumura, Sébastien Tixeuil:
Fault-Tolerant Offline Multi-Agent Path Planning. AAAI 2023: 11647-11654 - [c12]Keisuke Okumura:
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding. AAAI 2023: 11655-11662 - [c11]Keisuke Okumura:
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding. IJCAI 2023: 243-251 - [c10]Keisuke Okumura, Xavier Défago:
Quick Multi-Robot Motion Planning by Combining Sampling and Search. IJCAI 2023: 252-261 - 2022
- [c9]Keisuke Okumura, Xavier Défago:
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution. ICAPS 2022: 270-278 - [c8]Keisuke Okumura, Ryo Yonetani, Mai Nishimura, Asako Kanezaki:
CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces. AAMAS 2022: 972-981 - [c7]Keisuke Okumura, François Bonnet, Yasumasa Tamura, Xavier Défago:
Offline Time-Independent Multi-Agent Path Planning. IJCAI 2022: 4649-4656 - 2021
- [c6]Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Time-Independent Planning for Multiple Moving Agents. AAAI 2021: 11299-11307 - [c5]Shota Kameyama, Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Active Modular Environment for Robot Navigation. ICRA 2021: 8636-8642 - [c4]Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Iterative Refinement for Real-Time Multi-Robot Path Planning. IROS 2021: 9690-9697 - [c3]Mai Hirata, Manabu Tsukada, Keisuke Okumura, Yasumasa Tamura, Hideya Ochiai, Xavier Défago:
Roadside-Assisted Cooperative Planning using Future Path Sharing for Autonomous Driving. VTC Fall 2021: 1-7 - 2019
- [c2]Keisuke Okumura, Manao Machida, Xavier Défago, Yasumasa Tamura:
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding. IJCAI 2019: 535-542 - 2018
- [c1]Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Amoeba Exploration: Coordinated Exploration with Distributed Robots. iCAST 2018: 191-195
Informal and Other Publications
- 2024
- [i15]Keisuke Okumura:
Pathfinding with Lazy Successor Generation. CoRR abs/2408.15443 (2024) - 2023
- [i14]Keisuke Okumura:
Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding. CoRR abs/2305.03632 (2023) - [i13]Keisuke Okumura:
Engineering LaCAM*: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding. CoRR abs/2308.04292 (2023) - 2022
- [i12]Keisuke Okumura, Ryo Yonetani, Mai Nishimura, Asako Kanezaki:
CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces. CoRR abs/2201.09467 (2022) - [i11]Keisuke Okumura, Xavier Défago:
Quick Multi-Robot Motion Planning by Combining Sampling and Search. CoRR abs/2203.00315 (2022) - [i10]Keisuke Okumura:
LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding. CoRR abs/2211.13432 (2022) - [i9]Keisuke Okumura, Sébastien Tixeuil:
Fault-Tolerant Offline Multi-Agent Path Planning. CoRR abs/2211.13908 (2022) - 2021
- [i8]Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Iterative Refinement for Real-Time Multi-Robot Path Planning. CoRR abs/2102.12331 (2021) - [i7]Shota Kameyama, Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Active Modular Environment for Robot Navigation. CoRR abs/2102.12748 (2021) - [i6]Keisuke Okumura, François Bonnet, Yasumasa Tamura, Xavier Défago:
Offline Time-Independent Multi-Agent Path Planning. CoRR abs/2105.07132 (2021) - [i5]Mai Hirata, Manabu Tsukada, Keisuke Okumura, Yasumasa Tamura, Hideya Ochiai, Xavier Défago:
Roadside-assisted Cooperative Planning using Future Path Sharing for Autonomous Driving. CoRR abs/2108.04629 (2021) - [i4]Keisuke Okumura, Xavier Défago:
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution. CoRR abs/2109.04264 (2021) - 2020
- [i3]Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
Time-Independent Planning for Multiple Moving Agents. CoRR abs/2005.13187 (2020) - 2019
- [i2]Keisuke Okumura, Manao Machida, Xavier Défago, Yasumasa Tamura:
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding. CoRR abs/1901.11282 (2019) - [i1]Keisuke Okumura, Yasumasa Tamura, Xavier Défago:
winPIBT: Expanded Prioritized Algorithm for Iterative Multi-agent Path Finding. CoRR abs/1905.10149 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
