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

Matthew Bott

dblp:78/6230 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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 · 67% Robot navigation and mapping · 33%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
motion planning
0.112010
High quality goal connection for nonholonomic obstacle navigation allowing for drift using dynamic potential fields · ICRA 2010
Robotics › Motion planning and robot control › motion planning
nonholonomic motion planning
0.112010
High quality goal connection for nonholonomic obstacle navigation allowing for drift using dynamic potential fields · ICRA 2010
Robotics › Robot navigation and mapping › mobile robot navigation
obstacle navigation
0.112010
High quality goal connection for nonholonomic obstacle navigation allowing for drift using dynamic potential fields · ICRA 2010

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

gradient-based planning · 0.1adaptive replanning · 0.1
YearPublicationVenuePosition
2010 High quality goal connection for nonholonomic obstacle navigation allowing for drift using dynamic potential fields
abstract
The problem we address in this paper is how to plan and execute high quality paths for robots subject to nonholonomic constraints while navigating obstacles in 2D space. The navigation is to be carried out continuously at speed and may be subject to drift that is not predictable a priori. The problem raises the challenge of adaptively maintaining a smooth robust path of low computational cost. The algorithm is complete in providing feasible paths connecting to the goal in cluttered environments without global maps or positioning while also optimising the path curvature in free space. The approach is a generic gradient-based methodology set in dynamic potential fields that are not subject to fixed local minima or other misdirecting surface features of static fields. Multiple planning and execution cycles are interleaved to allow frequent updates for dealing with unanticipated obstacles and drift. We present our methodology and demonstrate experimental results for simulated robots. The results show that low curvature paths are found that robustly connect to the goal under perturbation through a sequence of fast adaptive replanning.
Michael K. Weir, Matthew Bott
ICRA2
2008 Enabling nonholonomic smoothness generically allowing for unpredictable drift
abstract
This paper addresses the problem of how to enable smoothness generically in nonholonomic motion planning for mobile robots travelling at speed both without and with unpredictable drift. The problem raises the challenge of maintaining goal connection while also optimising the path curvature. The approach is a gradient based methodology set in dynamic potential fields and has the capacity to enable integration with existing potential field based methods for obstacle avoidance and coordinated motion. The methodology interleaves multiple planning and execution cycles to deal with drift. We present our methodology and demonstrate experimental results for the 4-D unicycle and a nonholonomic integrator. The results show that the curvature metric used is able to improve smoothness to a given degree of optimality while reliably maintaining goal connection. They also show that interleaving and increased smoothness allows the path to keep relatively close to optimised plans.
Michael K. Weir, Jon P. Lewis, Matthew Bott
ICARCV3