Yasumasa Tamura

Dr. Yasumasa Tamura

Faculty of Information Science and Technology, Hokkaido University, Sapporo, Hokkaidō, Japan
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 April 2023 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
KOKeisuke Okumura
Keisuke Okumura
FBFrançois Bonnet
François Bonnet
YTYasumasa Tamura
Yasumasa Tamura
XDXavier Défago
Xavier Défago
This study examines a novel planning problem for multiple agents that cannot share holding resources, named Offline Time-Independent Multiagent Path Planning (OTIMAPP) . Given a graph and a set of start-goal pairs, the problem to be addressed is assigning a path to each agent, such that every agent eventually reaches its destination without blocking others, regardless of when each agent starts and finishes each own action. This motivation stems from timing uncertainties, including the reality gaps between planning and robot execution. In contrast to conventional solution, concepts of multirobot path planning that rely on timings, once OTIMAPP solutions are obtained, they can be executed without any synchronization between robot actions. Moreover, there is a theoretical guarantee that all robots eventually reach their destinations, provided they avoid interrobot collisions. This study attempts to establish OTIMAPP both theoretically and practically. Specifically, we present a formalization of the problem, solution conditions based on a categorization of deadlocks, computational complexities showing that OTIMAPP is computationally intractable, practical relaxation of the solution concept, two algorithms to solve OTIMAPP based on multiagent pathfinding algorithms, empirical results showing large OTIMAPP instances can be solved to some extent, as well as robot demonstrations of asynchronous OTIMAPP execution.

27 September 2021
Verified
Conference Paper
Open access
KOKeisuke Okumura
Keisuke Okumura
YTYasumasa Tamura
Yasumasa Tamura
XDXavier Defago
Xavier Defago
We study the iterative refinement of path planning for multiple robots, known as multi-agent pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a solution of MAPF is a set of paths without collisions. Iterative refinement for MAPF is desirable for three reasons: 1) optimization is intractable, 2) sub-optimal solutions can be obtained instantly, and 3) it is anytime planning, desired in online scenarios where time for deliberation is limited. Despite the high demand, this is under-explored in MAPF because finding good neighborhoods has been unclear so far. Our proposal uses a sub-optimal MAPF solver to obtain an initial solution quickly, then iterates the two procedures: 1) select a subset of agents, 2) use an optimal MAPF solver to refine paths of selected agents while keeping other paths unchanged. Since the optimal solvers are used on small instances of the problem, this scheme yields efficient-enough solutions rapidly while providing high scalability. We also present reasonable candidates on how to select a subset of agents. Evaluations in various scenarios show that the proposal is promising; the convergence is fast, scalable, and with reasonable quality.

1 August 2022
Verified
Book Chapter
Closed access
PDF file
STSatoshi Tanaka
Satoshi Tanaka
FBFrançois Bonnet
François Bonnet
STSébastien Tixeuil
Sébastien Tixeuil
YTYasumasa Tamura
Yasumasa Tamura

14 December 2020 in arXiv
Verified
Preprint
Open access
PDF file
KOKeisuke Okumura
Keisuke Okumura
YTYasumasa Tamura
Yasumasa Tamura
XDXavier Défago
Xavier Défago
The problem of Multi-agent Path Finding (MAPF) consists in providing agents with efficient paths while preventing collisions. Numerous solvers have been developed so far since MAPF is critical for practical applications such as automated warehouses. The recently-proposed Priority Inheritance with Backtracking (PIBT) is a promising decoupled method that solves MAPF iteratively with flexible priorities. The method is aimed to be decentralized and has a very low computational cost, but it is shortsighted in the sense that it plans only one step ahead, thus occasionally resulting in inefficient plannings. This work proposes a generalization of PIBT, called windowed PIBT (winPIBT), that introduces a configurable time window. winPIBT allows agents to plan paths anticipating multiple steps ahead. We prove that, similarly to PIBT, all agents reach their own destinations in finite time as long as the environment is a graph with adequate properties, e.g., biconnected. Experimental results over various scenarios confirm that winPIBT mitigates livelock situations occurring in PIBT, and usually plans more efficient paths given adequate window size.

22 June 2025
Verified
Book Chapter
Closed access
PDF file
XSXiangyu Su
Xiangyu Su
XDXavier Défago
Xavier Défago
MLMario Larangeira
Mario Larangeira
KMKazuyuki Mori
Kazuyuki Mori
TOTakuya Oda
Takuya Oda
KTKeisuke Tanaka
Keisuke Tanaka

2 April 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
KSKei Suzumura
Kei Suzumura
YTYasumasa Tamura
Yasumasa Tamura
SAShimpei Aihara
Shimpei Aihara
MYMasahito Yamamoto
Masahito Yamamoto
Curling is a sport in which two teams take turns delivering stones on ice and compete for total scores. It is a highly strategic sport, often referred to as “Chess on Ice”. In recent years, research on curling AI and statistical analysis aimed at tactical evaluation has been active. Decision-making in curling highly depends on the current stone position state, so obtaining stone positions is essential for tactical analysis. This study proposes an object detection model capable of acquiring stone coordinates with high accuracy and generality from stone position images of actual games. The proposed model was realized with a small amount of manually annotated data and pseudo-labeled images. Using the active testing method, the image-level accuracy of data—a strict criterion requiring perfect detection of all stones in a single image—for approximately 100,000 items was estimated to be 99.37%. Furthermore, we measured the positional error of the detected stones and found an average result of 0.472 px. We determined that this model had sufficient accuracy for practical use, so we decided to store the acquired coordinates in a database and use them as training data for the curling AI and statistical analysis.