CajunBot: Architecture and Algorithms
CajunBot, an autonomous ground vehicle and a finalist in the 2005 DARPA Grand Challenge, is built on the chassis of MAX IV, a six-wheeled ATV. Transformation of the ATV to an AGV (Autonomous Ground Vehicle) required adding drive-by-wire control, LIDAR sensors, an INS, and a computing system. Significant innovations in the core computational algorithms include an obstacle detection algorithm that takes advantage of shocks and bumps to improve visibility; a path planning algorithm that takes into account the vehicle’s maneuverability limits to generate paths that are navigable at high speed; efficient data structures and algorithms that require just a single Intel Pentium 4 HT 3.2 Ghz machine to handle all computations and a middleware layer that transparently distributes the computation to multiple machines, if desired. In addition, CajunBot also features support technologies such as a simulator, playback of logged data and live visualization on off-board computers to aid in development, testing, and debugging.
KeywordsObstacle Detection Global Point Warning Region Navigation Plan Autonomous Ground Vehicle
Unable to display preview. Download preview PDF.
- Barraquand et al., 1992
- de Smith, 2004.
- Dubins, 1957.
- Feng et al., 1990Feng, D., Singh, S., and Krogh, B. H. (1990). Implementation of dynamic obstacle avoidance on the CMU NavLab. In Proceedings of the 1990 IEEE Conference on Systems Engineering, pages 208–211.Google Scholar
- Gerkey et al., 2003Gerkey, B., Vaughan, R. T., and Howard, A. (2003). The Player/Stage project: Tools for multi-robot and distributed sensor systems. In Proceedings of the 11th International Conference on Advanced Robotics (ICAR’03), pages 317–323, Coimbra, Portugal.Google Scholar
- Hebert et al., 1997Hebert, M., Thorpe, C., and Stentz, A., editors (1997). Intelligent Unmanned Ground Vehicles: Autonomous Navigation Research at Carnegie Mellon University. Kluwer Academic Publishers.Google Scholar
- LaValle, 2006.LaValle, S. M. (to appear in 2006). Planning Algorithms, chapter 1, page 3. Cambridge University Press. http://msl.cs.uiuc.edu/planning/.
- Maida et al., 2006Maida, A. S., Golconda, S., Mejia, P., and Lakhotia, A. (2006). Subgoal-based local-navigation and obstacle-avoidance using a grid-distance field. International Journal of Vehicle Autonomous Systems.Google Scholar
- Marshall, 1999.Marshall, A. D. (1999). Programming in C, Unix System Calls and Subroutines using C, chapter IPC: Shared Memory. http://www.cs.cf.ac.uk/Dave/C/node27.html.
- Pardo-Castellote and Hamilton, 1999.Pardo-Castellote, S. S. G. and Hamilton, M. (1999). NDDS: The real-time publish-subscribe middleware. Technical report, Real-Time Innovations, Inc.Google Scholar
- Scheuer and Laugier, 1999.Scheuer, A. and Laugier, C. (1999). Planning sub-optimal and continuous-curvature paths for car-like robots. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems, volume 1, pages 25–31, Victoria, Canada.Google Scholar
- Scheuer and Xie, 1999.Scheuer, A. and Xie, M. (1999). Continuous-curvature trajectory planning for manoeuvrable non-holomorphic robots. In Proceeding of IEEE-RSJ International Conference on Intelligent Robots and Systems, volume 3, pages 1675–1680.Google Scholar
- Shackleford et al., 2000Shackleford, W. P., Proctor, F. M., and Michaloski, J. L. (2000). The neutral message language: A model and method for message passing in heterogeneous environments. In Proceedings of the World Automation Conference, Maui, Hawaii. http://www.isd.mel.nist.gov/documents/shackleford/Neutral_Message_Language.pdf.
- Simmons and James, 2001.Simmons, R. and James, D. (2001). IPC-A Reference Manual, version 3.6. Robotics Institute, Carnegie Mellon University. http://www.cs.cmu.edu/afs/cs/project/TCA/ftp/IPC_Manual.pdf.
- Stentz and Hebert, 1995.
- Vaughan, 2000.Vaughan, R. T. (2000). Gazebo: A multiple robot simulator. Technical Report IRIS-00-394, Institute for Robotics and Intelligent Systems, School of Engineering, University of Southern California.Google Scholar