Demo Data from EDBT 2026 / reviewers in the wild / expert
Clement Petres
dblp:185/1741
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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 · 39% Legged, aerial and field robots · 30% Planning, search and constraint satisfaction · 30% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Legged, aerial and field robots › underwater robotics
autonomous underwater vehicle |
0.1 | 1 | 2007 | Path Planning for Autonomous Underwater Vehicles · IEEE Trans. Robotics 2007 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › pathfinding › grid-based pathfinding
fast marching method |
0.1 | 1 | 2007 | Path Planning for Autonomous Underwater Vehicles · IEEE Trans. Robotics 2007 |
Robotics › Motion planning and robot control
path planning |
0.1 | 1 | 2007 | Path Planning for Autonomous Underwater Vehicles · IEEE Trans. Robotics 2007 |
Methods — techniques the papers use, named apart from their topics
multiresolution method · 0.1fast marching · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Path Planning for Autonomous Underwater VehiclesabstractEfficient path-planning algorithms are a crucial issue for modern autonomous underwater vehicles. Classical path-planning algorithms in artificial intelligence are not designed to deal with wide continuous environments prone to currents. We present a novel Fast Marching (FM)-based approach to address the following issues. First, we develop an algorithm we call FM* to efficiently extract a 2-D continuous path from a discrete representation of the environment. Second, we take underwater currents into account thanks to an anisotropic extension of the original FM algorithm. Third, the vehicle turning radius is introduced as a constraint on the optimal path curvature for both isotropic and anisotropic media. Finally, a multiresolution method is introduced to speed up the overall path-planning process. Clement Petres, Yan Pailhas, Pedro Patrón, Yvan R. Petillot, Jonathan Evans, David M. Lane |
IEEE Trans. Robotics | 1 |