EDBT 2026 Demo / reviewers in the wild / expert
Andrew Tinka
dblp:38/7143
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Planning, search and constraint satisfaction · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › multi-agent path finding
lifelong multi-agent path finding |
0.5 | 1 | 2021 | Lifelong Multi-Agent Path Finding in Large-Scale Warehouses · AAAI 2021 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
multi-agent path finding |
0.5 | 1 | 2021 | Lifelong Multi-Agent Path Finding in Large-Scale Warehouses · AAAI 2021 |
Methods — techniques the papers use, named apart from their topics
rolling-horizon collision resolution · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Lifelong Multi-Agent Path Finding in Large-Scale WarehousesabstractMulti-Agent Path Finding (MAPF) is the problem of moving a team of agents to their goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where agents are constantly engaged with new goal locations, such as in large-scale automated warehouses. We propose a new framework Rolling-Horizon Collision Resolution (RHCR) for solving lifelong MAPF by decomposing the problem into a sequence of Windowed MAPF instances, where a Windowed MAPF solver resolves collisions among the paths of the agents only within a bounded time horizon and ignores collisions beyond it. RHCR is particularly well suited to generating pliable plans that adapt to continually arriving new goal locations. We empirically evaluate RHCR with a variety of MAPF solvers and show that it can produce high-quality solutions for up to 1,000 agents (= 38.9% of the empty cells on the map) for simulated warehouse instances, significantly outperforming existing work. Jiaoyang Li 0001, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig |
AAAI | 2 |
| 2014 | Autonomous River Navigation Using the Hamilton-Jacobi Framework for Underactuated VehiclesabstractThe feasibility of drifter studies in complex and tidally forced water networks has been greatly expanded by the introduction of motorized floating sensors. This paper presents a method for such motorized sensors to accomplish obstacle avoidance and path selection using the solutions to Hamilton-Jacobi-Bellman-Isaacs (HJBI) equations. The method is then validated experimentally. Kevin Weekly, Andrew Tinka, Leah Anderson, Alexandre M. Bayen |
IEEE Trans. Robotics | 2 |
| 2011 | Autonomous river navigation using the Hamilton-Jacobi framework for underactuated vehiclesabstractMotorized floating sensors have distinct advantages over their non-actuated counterparts. A motorized unit can prevent the sensor from washing ashore or heading into dangerous areas, expanding the mission regions in which they can be feasibly operated. In this article, we present a control frame work and describe the physically realized system used to prove its effectiveness. The controller uses two minimum-time-to-reach (MTTR) functions-one giving the time to reach the center of the river and one giving the time to reach the shoreline. The MTTR functions are constructed from solutions to Hamilton Jacobi-Bellman-Isaacs (HJBI) Equations. Contours along these functions are used to define the state transition thresholds for an on-off controller. The first MTTR function is also used to construct the optimal bearing to travel back to the center of the river. We investigate the effectiveness of the controller using a software-in-the-loop (SIL) simulator. Using prototypes built at UC Berkeley, results from a field operational test in the Sacramento-San Joaquin River Delta are then presented to validate the simulation results. Kevin Weekly, Leah Anderson, Andrew Tinka, Alexandre M. Bayen |
ICRA | 3 |