Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T09:23:20.488Z Has data issue: false hasContentIssue false
  • English
  • Français

A method for robot navigation toward a moving goal with unknown maneuvers

Published online by Cambridge University Press:  10 November 2005

F. Belkhouche  and
B. Belkhouche
F. Belkhouche
Affiliation:
EECS department, Tulane University, New Orleans, LA 70118 (USA)
B. Belkhouche
Affiliation:
EECS department, Tulane University, New Orleans, LA 70118 (USA)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper deals with a method for robot navigation towards a moving goal. The goal maneuvers are not a priori known to the robot. Our method is based on the use of the kinematics equations of the robot and the goal combined with geometrical rules. First a kinematics model for the tracking problem is derived and two strategies are suggested for robot navigation, namely the velocity pursuit guidance law and the deviated pursuit guidance law. It turns out that in both cases, the robot's angular velocity is equal to the line of sight angle rate. Important properties of the navigation strategies are discussed and proven. In the presence of obstacles, two navigation modes are used: the tracking mode, which has a global aspect and the obstacle avoidance mode, which has a local aspect. In the obstacle avoidance mode, a polar diagram combining information about obstacles and directions corresponding to the pursuit is constructed. An extensive simulation study is carried out, where the efficiency of both strategies is illustrated for different scenarios.

Keywords

Robot navigationTarget trackingMoving goal
Type
Research Article
Information
Robotica , Volume 23 , Issue 6 , November 2005 , pp. 709 - 720
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)