![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Yasumasa Tamura
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Keisuke Okumura
, François Bonnet
, Yasumasa Tamura
, Xavier Défago
:
Offline Time-Independent Multiagent Path Planning. IEEE Trans. Robotics 39(4): 2720-2737 (2023) - [c11]Nicholaus D. Yosodipuro, Ehsan Javanmardi, Jin Nakazato, Yasumasa Tamura, Xavier Défago, Manabu Tsukada:
Mixed-traffic Intersection Management using Traffic-load-responsive Reservation and V2X -enabled Speed Coordination. ITSC 2023: 1927-1934 - [c10]Yuji Yamazaki, Yasumasa Tamura, Xavier Défago, Ehsan Javanmardi, Manabu Tsukada:
ToST: Tokyo SUMO Traffic Scenario. ITSC 2023: 3597-3604 - 2022
- [j5]Keisuke Okumura
, Manao Machida, Xavier Défago
, Yasumasa Tamura
:
Priority inheritance with backtracking for iterative multi-agent path finding. Artif. Intell. 310: 103752 (2022) - [c9]Keisuke Okumura
, François Bonnet, Yasumasa Tamura, Xavier Défago:
Offline Time-Independent Multi-Agent Path Planning. IJCAI 2022: 4649-4656 - [i10]Xiangyu Su, Xavier Défago, Mario Larangeira, Kazuyuki Mori, Takuya Oda, Yuta Okumura, Yasumasa Tamura, Keisuke Tanaka:
Bid-Matching Problem and Score-Based Consensus for Peer-to-Peer Energy Trading. IACR Cryptol. ePrint Arch. 2022: 1471 (2022) - 2021
- [c8]Keisuke Okumura
, Yasumasa Tamura, Xavier Défago
:
Time-Independent Planning for Multiple Moving Agents. AAAI 2021: 11299-11307 - [c7]Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura
:
Quixo is Solved. ACG 2021: 85-95 - [c6]Shota Kameyama, Keisuke Okumura
, Yasumasa Tamura
, Xavier Défago
:
Active Modular Environment for Robot Navigation. ICRA 2021: 8636-8642 - [c5]Keisuke Okumura
, Yasumasa Tamura
, Xavier Défago
:
Iterative Refinement for Real-Time Multi-Robot Path Planning. IROS 2021: 9690-9697 - [c4]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 - [i9]Keisuke Okumura
, Yasumasa Tamura, Xavier Défago:
Iterative Refinement for Real-Time Multi-Robot Path Planning. CoRR abs/2102.12331 (2021) - [i8]Shota Kameyama, Keisuke Okumura
, Yasumasa Tamura, Xavier Défago:
Active Modular Environment for Robot Navigation. CoRR abs/2102.12748 (2021) - [i7]Keisuke Okumura
, François Bonnet, Yasumasa Tamura, Xavier Défago:
Offline Time-Independent Multi-Agent Path Planning. CoRR abs/2105.07132 (2021) - [i6]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) - 2020
- [j4]Motoaki Hiraga
, Yasumasa Tamura
, Kazuhiro Ohkura:
Behavioral specialization emerges from the embodiment of a robotic swarm. Artif. Life Robotics 25(4): 495-502 (2020) - [c3]Xavier Défago
, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura
:
Communication Efficient Self-Stabilizing Leader Election. DISC 2020: 11:1-11:19 - [i5]Keisuke Okumura
, Yasumasa Tamura, Xavier Défago:
Time-Independent Planning for Multiple Moving Agents. CoRR abs/2005.13187 (2020) - [i4]Satoshi Tanaka, François Bonnet, Sébastien Tixeuil, Yasumasa Tamura:
Quixo Is Solved. CoRR abs/2007.15895 (2020) - [i3]Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, Yasumasa Tamura:
Communication Efficient Self-Stabilizing Leader Election (Full Version). CoRR abs/2008.04252 (2020)
2010 – 2019
- 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 - [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) - 2018
- [j3]Gabriele Valentini
, Anthony Antoun, Marco Trabattoni
, Bernát Wiandt, Yasumasa Tamura
, Etienne Hocquard, Vito Trianni, Marco Dorigo:
Kilogrid: a novel experimental environment for the Kilobot robot. Swarm Intell. 12(3): 245-266 (2018) - [c1]Keisuke Okumura
, Yasumasa Tamura
, Xavier Défago:
Amoeba Exploration: Coordinated Exploration with Distributed Robots. iCAST 2018: 191-195 - 2015
- [j2]Yasumasa Tamura
, Hiroyuki Iizuka, Masahito Yamamoto, Masashi Furukawa:
Application of local clustering organization to reactive job-shop scheduling. Soft Comput. 19(4): 891-899 (2015) - 2013
- [j1]Yasumasa Tamura
, Masahito Yamamoto, Ikuo Suzuki, Masashi Furukawa:
Acquisition of Dispatching Rules for Job-Shop Scheduling Problem by Artificial Neural Networks Using PSO. J. Adv. Comput. Intell. Intell. Informatics 17(5): 731-738 (2013)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint