Demo Data from EDBT 2026 / reviewers in the wild / expert
H. W. Jun
dblp:246/7666
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author
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 |
Motion planning and robot control · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Motion planning and robot control
collision avoidance |
0.4 | 1 | 2019 | Goal-Driven Navigation for Non-holonomic Multi-Robot System by Learning Collision · ICRA 2019 |
Robotics › Motion planning and robot control › collision avoidance
multi-robot collision avoidance |
0.4 | 1 | 2019 | Goal-Driven Navigation for Non-holonomic Multi-Robot System by Learning Collision · ICRA 2019 |
Robotics › Motion planning and robot control › motion planning › replanning
dynamic replanning |
0.1 | 1 | 2019 | Goal-Driven Navigation for Non-holonomic Multi-Robot System by Learning Collision · ICRA 2019 |
Robotics › Motion planning and robot control
motion planning |
0.1 | 1 | 2019 | Goal-Driven Navigation for Non-holonomic Multi-Robot System by Learning Collision · ICRA 2019 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Goal-Driven Navigation for Non-holonomic Multi-Robot System by Learning CollisionabstractIn this paper, we propose the reinforcement learning based multi-robot collision avoidance approach by learning collision. Dynamical path re-planning, which is massively used in classical collision avoidance methods, needs overall information of the environment. Also, training agent robots to avoid the collision and pursue a goal point simultaneously is inefficient since the agent should learn two tasks. As the number of tasks that the agent should learn increases, it is difficult to make the performance of an algorithm consistent, which is known as reproducibility issue. To overcome these limitations, Collision Avoidance by Learning Collision (CALC), which learns collision instead of avoiding an obstacle robot is suggested. To solve the collision avoidance problem efficiently, the proposed method divides the problem into training and planning. In the training algorithm, an agent robot learns how to collide with a single obstacle robot and then generates a trained policy. With the trained policy, the agent can pursue a goal point since the policy leads the agent to `collide' with the goal. Furthermore, by taking action in a reverse way from the trained policy, the agent can avoid multiple obstacle robots in the planning algorithm at once. The proposed method is validated both in the robot simulation and real robot experiment, and compared with the existing collision avoidance method. H. W. Jun, H. J. Kim, B. H. Lee |
ICRA | 1 |