Skip to search formSkip to main contentSkip to account menu

Any-angle path planning

Known as: Anyangle search, Any-angle planning, Theta* 
Any-angle path planning algorithms search for paths on a cell decomposition of a continuous configuration space (such as a two-dimensional terrain).
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Any-angle path planning algorithms are a popular topic of research in the fields of robotics and video games with a key focus in… 
2017
2017
Path planning on a 2D-grid is a well-studied problem in robotics. It usually involves searching for a shortest path between two… 
2017
2017
In this paper, an efficient methodology to assess rotor angle stability (RAS) in parameter space has been proposed. This… 
2010
2010
Abstract— Autostereoscopic and polarization‐based stereoscopic 3‐D displays recreate 3‐D images by providing different images in… 
2010
2010
This stand-along path-planning project for an undergraduate or graduate artificial intelligence class relates to video game… 
2005
2005
This paper is devoted to a stability study of a walking gait for a biped. The walking gait is periodic and it is composed of a… 
1990
1990
  • H. NaHua Lee
  • 1990
  • Corpus ID: 34721906
Traditionally, knowledge of the ionospheric electron density is obtained using Faraday rotation or differential Doppler… 
1977
1977
Abstract : A method is presented together with a computer program for calculating the forces and moments on the components of a… 
Highly Cited
1975
Highly Cited
1975
An approximate expression for the variation with L of the equatorial pitch angle of a particle undergoing adiabatic convection in…