Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    ISSN: 1432-0541
    Keywords: Robotics ; Robot motion planning ; Collision avoidance algorithms ; Planning with uncertainty ; Provable algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The problem of path planning for an automaton moving in a two-dimensional scene filled with unknown obstacles is considered. The automaton is presented as a point; obstacles can be of an arbitrary shape, with continuous boundaries and of finite size; no restriction on the size of the scene is imposed. The information available to the automaton is limited to its own current coordinates and those of the target position. Also, when the automaton hits an obstacle, this fact is detected by the automaton's “tactile sensor.” This information is shown to be sufficient for reaching the target or concluding in finite time that the target cannot be reached. A worst-case lower bound on the length of paths generated by any algorithm operating within the framework of the accepted model is developed; the bound is expressed in terms of the perimeters of the obstacles met by the automaton in the scene. Algorithms that guarantee reaching the target (if the target is reachable), and tests for target reachability are presented. The efficiency of the algorithms is studied, and worst-case upper bounds on the length of generated paths are produced.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Chichester, West Sussex : Wiley-Blackwell
    Mathematical Methods in the Applied Sciences 21 (1998), S. 1655-1679 
    ISSN: 0170-4214
    Keywords: Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: In this paper the problem of collision analysis for a mobile robot operating in a planar environment with moving objects (obstacles) is addressed. The pattern of motion of the potential obstacles cannot be predicted; only a bound on their maximum velocity is available. Based on this information, at its current position the robot constructs the Hazard Region that corresponds to the path it contemplates. If the Hazard Region contains at least one obstacle, then there is a potential for this obstacle to collide with the robot (in which case perhaps another path should be planned). We first derive the solution for Hazard Region for two standard path primitives, a straight line segment and a circular arc segment; the solution is exact, except for one special case (for which the approximation error is estimated). This result is then applied to a more complex case when the path presents a combination of those primitives. Such are, for example, the optimal (shortest) paths with constrained curvature (known as Dubins paths [3]), which connect two points, each with a prescribed direction of motion. © 1998 B. G. Teubner Stuttgart - John Wiley & Sons, Ltd.
    Additional Material: 18 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Chichester, West Sussex : Wiley-Blackwell
    Mathematical Methods in the Applied Sciences 18 (1995), S. 67-82 
    ISSN: 0170-4214
    Keywords: Mathematics and Statistics ; Applied Mathematics
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: The problem of robot motion planning in an environment with obstacles can often be reduced to the study of connectivity of the robot's free configuration space. In turn, space connectivity can be analysed via the corresponding connectivity graph. For two-degree-of-freedom robots, the free configuration space presents a two-dimensional (2D) surface - a compact subspace of a 2D orientable compact manifold. This paper addresses the following abstract problem: given a compact 2D surface bounded by simple closed curves and lying in an orientable 2D manifold (a sphere, a torus, etc.) and given two points in the subspace, suggest a systematic way of defining the connectivity graph in the subspace, based on its topological properties. The use of space topology results in powerful, from the robotics standpoint, provable algorithms capable of on-line motion planning in an environment with unknown obstacles of arbitrary shapes. This makes the method distinct from other techniques, which require complete information, algebraic representation of space geometry, and off-line computation.
    Additional Material: 13 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...