A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
A NEW PARAMETERIZED POTENTIAL FAMILY FOR PATH PLANNING ALGORITHMS
2009
International journal on artificial intelligence tools
In this work, it is proposed a new family of potentials for path planning algorithms, one kind to the goal and other to the obstacles. With these new potentials it is possible to parameterize the potential scale length and strength easily, providing better control over the moving object path characteristics. In this way, the path problem can be treated analytically. For example, the minimum distance between the moving object and the obstacles can be calculated as a function of the potential
doi:10.1142/s0218213009000470
fatcat:ly7vycfylfcbpi7tfpd3wduhmm