Displaying similar documents to “Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent”

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....

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...

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.

Reliable robust path planning with application to mobile robots

Romain Pepy, Michel Kieffer, Eric Walter (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementations, where compact sets are wrapped into boxes. The resulting path planner is then used for...