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

O. Pinchard

dblp:126/4906 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1996
—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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning › smooth path planning
continuous-curvature path
0.011996
Generalized polar polynomials for vehicle path generation with dynamic constraints · ICRA 1996
Robotics › Motion planning and robot control › path planning
path generation
0.011996
Generalized polar polynomials for vehicle path generation with dynamic constraints · ICRA 1996
Robotics › Motion planning and robot control › robot dynamics
dynamic constraints
0.011996
Generalized polar polynomials for vehicle path generation with dynamic constraints · ICRA 1996

Methods — techniques the papers use, named apart from their topics

polar polynomials · 0.0
YearPublicationVenuePosition
1996 Generalized polar polynomials for vehicle path generation with dynamic constraints
abstract
The paths generated by a high-level planner consist of sequences of positions and headings, i.e. configurations, that need a proper interpolation procedure for providing continuous controls of the vehicles. In the case of motions at constant speed, Nelson (1989) has proposed continuous-curvature paths using polar polynomials for describing the turns between two straight line segments. The corresponding curves have closed-form equations and are easy to compute. In this paper, we address the general case of interpolation between two consecutive segments travelled at different speeds, while taking into account the kinematic and dynamic limitations on the break angle, speed and acceleration. The generalized polar polynomials are thus obtained, which allow the planning of fast motions. Important properties of the polynomials are demonstrated and their use provides a method for computing the best motion consistent with the constraints. Examples are presented to illustrate the theoretical results.
O. Pinchard, Alain Liégeois, F. Pougnet
ICRA1