Results 291 to 300 of about 371,797 (314)
A mobile robot safe planner for multiple tasks in human-shared environments. [PDF]
PLoS OneMi J +6 more
europepmc +1 more source
Shortest paths with side sensors [PDF]
2011 IEEE International Conference on Robotics and Automation, 2011 We present a complete characterization of shortest paths to a goal position for a vehicle with unicycle kinematics and a limited range sensor, constantly keeping a given landmark in sight. Previous work on this subject studied the optimal paths in case of a frontal, symmetrically limited Field-Of-View (FOV). In this paper we provide a generalization to
SALARIS, PAOLO +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Methods of Operations Research (ZOR), 2000
A class of cooperative TU-games arising from shortest path problems is introduced and analyzed. Some conditions under which a shortest path game is balanced are obtained. Also an axiomatic characterization of the Shapley value for this class of games is provided.
FRAGNELLI, Vito +2 more
openaire +2 more sources
A class of cooperative TU-games arising from shortest path problems is introduced and analyzed. Some conditions under which a shortest path game is balanced are obtained. Also an axiomatic characterization of the Shapley value for this class of games is provided.
FRAGNELLI, Vito +2 more
openaire +2 more sources
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS [PDF]
International Journal of Computational Geometry & Applications, 1996 We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the ...
Jindong Chen, Yijie Han
openaire +1 more source
Annals of Operations Research, 1988
Theshortest path problem is considered from a computational point of view. Eight algorithms which solve theshortest path tree problem on directed graphs are presented, together with the results of wide-ranging experimentation designed to compare their relative performances on different graph topologies.
GALLO, GIORGIO ANGELO +1 more
openaire +3 more sources
Theshortest path problem is considered from a computational point of view. Eight algorithms which solve theshortest path tree problem on directed graphs are presented, together with the results of wide-ranging experimentation designed to compare their relative performances on different graph topologies.
GALLO, GIORGIO ANGELO +1 more
openaire +3 more sources
2011
The introductory chapter explains the difference between shortest paths in finite graphs and shortest paths in Euclidean geometry, which is also called ‘the common geometry of our world’. The chapter demonstrates the diversity of such problems, defined between points in a plane, on a surface, or in the 3-dimensional space.
Fajie Li, Reinhard Klette
openaire +2 more sources
The introductory chapter explains the difference between shortest paths in finite graphs and shortest paths in Euclidean geometry, which is also called ‘the common geometry of our world’. The chapter demonstrates the diversity of such problems, defined between points in a plane, on a surface, or in the 3-dimensional space.
Fajie Li, Reinhard Klette
openaire +2 more sources
2008
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire +4 more sources
Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routing in data networks, and transportation problems.
openaire +4 more sources
Shortest Paths with Shortest Detours
Journal of Optimization Theory and Applications, 2017This paper is concerned with a biobjective routing problem, called the shortest path with shortest detour problem, in which the length of a route is minimized as one criterion and, as second, the maximal length of a detour route if the chosen route is blocked is minimized.
Carolin Torchiani +3 more
openaire +2 more sources
The shortest path problem with forbidden paths
European Journal of Operational Research, 2005We consider a variant of the constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. Two solution approaches are proposed for this variant. The first uses Aho and Corasick's keyword matching algorithm to filter paths produced by a k-shortest paths ...
Guy Desaulniers, Daniel Villeneuve
openaire +3 more sources