Displaying similar documents to “Reliable robust path planning with application to mobile robots”

The maximum capacity shortest path problem : generation of efficient solution sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...

On path following control of nonholonomic mobile manipulators

Alicja Mazur, Dawid Szakiel (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper describes the problem of designing control laws for path following robots, including two types of nonholonomic mobile manipulators. Due to a cascade structure of the motion equation, a backstepping procedure is used to achieve motion along a desired path. The control algorithm consists of two simultaneously working controllers: the kinematic controller, solving motion constraints, and the dynamic controller, preserving an appropriate coordination between both subsystems of...

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)

RAIRO - Operations Research

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...

Emotion learning: Solving a shortest path problem in an arbitrary deterministic environment in linear time with an emotional agent

Silvana P Etruseva (2008)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network crossbar adaptive array). By implementing emotion learning, the linear time algorithm is obtained and the agent architecture is modified....

Cooperative driving at isolated intersections based on the optimal minimization of the maximum exit time

Jia Wu, Abdeljalil Abbas-Turki, Florent Perronnet (2013)

International Journal of Applied Mathematics and Computer Science

Similarity:

Traditional traffic control systems based on traffic light have achieved a great success in reducing the average delay of vehicles or in improving the traffic capacity. The main idea of these systems is based on the optimization of the cycle time, the phase sequence, and the phase duration. The right-of-ways are assigned to vehicles of one or several movements for a specific time. With the emergence of cooperative driving, an innovative traffic control concept, Autonomous Intersection...

Multiple routing strategies in a labelled network

J. Maublanc, D. Peyrton, A. Quilliot (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.