Madeline Larcombe

dblp:230/6969 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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
Robot navigation and mapping · 61% Motion planning and robot control · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › mobile robot navigation
goal seeking
0.011991
A goal seeking and obstacle avoiding algorithm for autonomous mobile robots · ICRA 1991
Robotics › Motion planning and robot control › robot control › nonholonomic systems
nonholonomic vehicle control
0.011991
A goal seeking and obstacle avoiding algorithm for autonomous mobile robots · ICRA 1991
Robotics › Robot navigation and mapping
obstacle avoidance
0.011991
A goal seeking and obstacle avoiding algorithm for autonomous mobile robots · ICRA 1991
Robotics › Motion planning and robot control
trajectory optimization
0.011991
A goal seeking and obstacle avoiding algorithm for autonomous mobile robots · ICRA 1991

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

kinematic constraint modeling · 0.0dynamic constraint modeling · 0.0
YearPublicationVenuePosition
1991 A goal seeking and obstacle avoiding algorithm for autonomous mobile robots
abstract
The authors present an algorithm designed to provide a robot-vehicle with sufficient 'intelligence' to be able to optimize its behavior in the light of information while carrying out the task of moving from any position and orientation to any other position and orientation. The kinematic and dynamic constraints of a nonholonomic vehicle are included explicitly. It is thus possible to finesse issues concerned with producing planned paths that cannot be achieved in practice by a real vehicle. Some of the maneuvers that this algorithm can support are shown. The algorithm has been designed to allow the inclusion of unmapped obstacles and thus has the potential of being extended to situations where there are multiple moving vehicles.>
Barry Steer, Madeline Larcombe
ICRA2