• Theta*

  • Referenced in 7 articles [sw31693]
  • Theta*: Any-Angle Path Planning on Grids. Grids with blocked and unblocked cells are often ... terrain in robotics and video games. However, paths formed by grid edges can be longer ... correct and complete any-angle path-planning algorithms that avoid this shortcoming. Basic Theta ... propagate information along grid edges without constraining paths to grid edges. Basic Theta* is simple...
  • CARMEN

  • Referenced in 8 articles [sw10656]
  • sensor control, logging, obstacle avoidance, localization, path planning, and mapping...
  • Graphs

  • Referenced in 104 articles [sw12277]
  • this preprocessing step, applications may ask shortest-path or distance queries, which should be answered ... different names): algorithm engineers construct fast route planning methods; database and information systems researchers investigate ... selected approaches, algorithms, and results on shortest-path queries from these fields, with the main...
  • CajunBot

  • Referenced in 2 articles [sw01931]
  • bumps to improve visibility; a path planning algorithm that takes into account the vehicle...
  • LAMP

  • Referenced in 2 articles [sw13377]
  • Symbolic computation for mobile robot path planning. Motion planning for mobile robots is an arduous...
  • D* Extra Lite

  • Referenced in 2 articles [sw20992]
  • frontier-gap repairing. Searching for the shortest-path in an unknown or changeable environment ... update maps and to perform re-planning in order to complete their missions. D* Lite ... large number of typical two-dimensional path-planning problems, D* Extra Lite...
  • OpenGJK

  • Referenced in 2 articles [sw32667]
  • applications of these algorithms include robot path planning, image rendering and collision detection. However, each...
  • ECM

  • Referenced in 1 article [sw22840]
  • medial axis for real-time path planning and crowd simulation. We describe and demonstrate ... navigation mesh for path planning and crowd simulation in virtual environments. For a bounded ... used to compute short and smooth paths for disk-shaped characters of any radius...
  • VisiLibity

  • Referenced in 1 article [sw33404]
  • floating-point visibility algorithms, path planning, and supporting data types. It is intended ... applications include, e.g., manufacturing, facility location, architectural/urban planning, games, and education. The entire library consists ... applications where simple visibility and path planning computations are needed but the power ... holes: visibility polygons; visibility graphs; Euclidean shortest paths for a point; Python, Ruby, and Matlab...
  • DroneKit Python

  • Referenced in 1 article [sw27746]
  • advanced use cases including computer vision, path planning, 3D modelling etc). It can also...
  • EDURobot

  • Referenced in 1 article [sw23617]
  • enable comprehension of characteristics of different path planning algorithms...
  • SCARF

  • Referenced in 1 article [sw21232]
  • matching candidate is passed to a path-planning system that navigates the robot vehicle...
  • CWave

  • Referenced in 0 articles [sw31695]
  • High-performance single-source any-angle path planning on a grid. Path planning ... vertices on a grid. Single-source path planning is a modified problem which asks ... algorithm for single-source any-angle path planning on a grid that we named CWave ... work. “Any-angle” attribute of a path planning algorithm implies that such algorithm can find...
  • D*Lite

  • Referenced in 6 articles [sw20991]
  • path. It is able to replan one to two orders of magnitudes faster than planning...
  • SPIDER

  • Referenced in 5 articles [sw14387]
  • careful planning and provisioning of the basic units of transmission — the light-paths. This paper...
  • lop.gms

  • Referenced in 3 articles [sw29936]
  • lop.gms : Line Optimization. The problem finds line plans for a given rail network and origin ... possible lines is defined by the shortest paths in the rail network...
  • A-RESCUE

  • Referenced in 3 articles [sw20579]
  • across different areas relative to the storm path and the most congested O-D pairs ... simulation tool can be used as a planning tool to make decisions related...
  • Opal

  • Referenced in 3 articles [sw21958]
  • description of Opal. We begin by defining path algebras and giving their relationship to other ... implementation and module structure. Finally, planned extensions to the sytem and the interface are presented...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • unified algorithmic framework for Minimum Cost Disjoint Paths Problems. These problems arise in a variety ... main motivation typically is the desire to plan a structure which is safe ... with Containerterminal Altenwerder at Hamburg harbour. Disjoint Paths Problems are posed in the form...
  • GAID

  • Referenced in 1 article [sw21405]
  • this paper we describe the multiagent planning problem, a variant of the classical multiple traveling ... team of m agents, m subtours (simple paths) are sought such that each target ... objective is to find the team plan in which the longest subtour is as short...