A paradigm for probabilistic path planning

Abstract

4 Application to nonholonomic robots, and experimental results 12 4.1 Application to general carlike robots . . . . . . . . . . . . . . . . . . . . . . . 14 4.1.1 Filling in the details . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.1.2 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4.2 Application to forward carlike robots . . . . . . . . . . . . . . . . . . . . . . . 17 4.2.1 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 4.3 Application to tractor-trailer robots . . . . . . . . . . . . . . . . . . . . . . . 18 4.3.1 Experimental results . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19