Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yan Pailhas

dblp:63/6083 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-7075-4110ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 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
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

TopicWeightPapersLastEvidence papers
Robotics › Legged, aerial and field robots › underwater robotics
autonomous underwater vehicle
0.112007
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.112007
Path Planning for Autonomous Underwater Vehicles · IEEE Trans. Robotics 2007
Robotics › Motion planning and robot control
path planning
0.112007
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
YearPublicationVenuePosition
2024 On the Estimation of the Size of a Target Population
abstract
This paper is concerned with the Bayesian estimation with possibility theory of the number of targets in an area of interest when no prior information is available. The estimation relies solely on the number of detections that is reported every time the area is surveyed. It is assumed that detections can be true and false positives. Possibility theory is capable of quantifying the complete absence of prior information on the number of targets with the introduction of a prior possibility function that is equal to one everywhere on the set of natural numbers. This has no equivalent in probability theory. The prior possibility function is turned into a posterior possibility function from which a point estimate of the number of targets can be derived. Besides the point estimate, a meaningful notion of confidence interval can be derived from the posterior possibility and necessity associated with subsets of the natural numbers.
Nicolas Valeyrie, Jeremie Houssineau, Christopher Strode, Yan Pailhas
FUSION4
2007 Path Planning for Autonomous Underwater Vehicles
abstract
Efficient 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. Robotics2