Helicopter Path Planning using Probabilistic Roadmaps

@inproceedings{Pettersson2003HelicopterPP,
  title={Helicopter Path Planning using Probabilistic Roadmaps},
  author={Per Olof Pettersson},
  year={2003}
}
Probabilistic roadmap algorithms work in two stages. In the first, by randomly choosing collision free configurations of a robot and then attempting to connect these, a graph is created which represents the free space of the robot’s environment. This graph can then be used to answer path planning queries during runtime. In this report I describe an adaptation of this algorithm to the domain of an autonomously flying helicopter. I also present two extensions to the algorithm: visibility based… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Fredrik Heintz, Per Olof Pettersson, Tommy Persson, and Björn Wingman. A distributed architecture for intelligent unmanned aerial vehicle experimentation

  • Patrick Doherty, Patrik Hasslum, Torsten Merz, Erik Skarman, Gianpaolo Conte, Simone Duranti
  • Fredrik Heintz, Per Olof Pettersson, Tommy…
  • 2003

Helicopter control design. Internal technical report

  • Erik Skarman
  • Helicopter control design. Internal technical…
  • 2001

Similar Papers

Loading similar papers…