J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572-- 577, Cincinnati, Ohio, May 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....approach is called sequencing [10] Another heuristic approach involves discretizing a planar world into pixels of some resolution. Typically, this approach handles errors in sonar sensing readings quite well by assigning each pixel a value indicating the likelihood that it overlaps an obstacle [1]. Strong experimental results indicate the utility of these approaches, and thus these algorithms may provide a future basis for complete sensor based planners. Unfortunately, these approaches neither afford proofs of correctness that guarantee a path can be found, nor offer well established ....

J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572-- 577, Cincinnati, Ohio, May 1990.

....(e.g. following a wall) 3] Another heuristic approach involves discretizing a planar world into pixels of some resolution. Typically, this approach handles errors in sonar sensing readings quite well by assigning each pixel a value indicating the likelihood that it overlaps an obstacle [2]. Strong experimental results indicate the utility of these approaches, and thus these algorithms may provide a future basis for complete sensor based planners. Unfortunately, these approaches neither afford proofs of correctness that guarantee a path can be found, nor offer well established ....

J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572-- 577, Cincinnati, Ohio, May 1990.

....strong experimental results indicating the utility of these approaches (such as [22] some of these algorithms may provide a future basis for provably correct sensor based planners. Another type of heuristic approach involves the discretization of a planar world into pixels (Borenstein and Koren [4]) In this approach, each pixel is assigned a value indicating the likelihood that it overlaps an obstacle. This method lends itself very nicely to implementation with real sensors, but discretizing the world may require a large amount of computer memory and may lead to an inaccurate ....

J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572--577, Cincinnati, Ohio, May 1990.

....(e.g. following a wall) 2] Another heuristic approach involves discretizing a planar world into pixels of some resolution. Typically, this approach handles errors in sonar sensing readings quite well by assigning each pixel a value indicating the likelihood that it overlaps an obstacle [1]. Strong experimental results indicate the utility of these approaches, and thus these algorithms may provide a future basis for complete sensor based planners. Unfortunately, these approaches neither afford proofs of correctness that guarantee a path can be found, nor offer well established ....

J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572-- 577, Cincinnati, Ohio, May 1990.

....based planners. Another type of heuristic approach involves discretizing the planar world into pixels of some resolution. Typically, this is used when approximating errors in sonar sensing readings, where each pixel is a assigned a value indicating the likelihood that it overlaps an obstacle [1]. This method lends itself very nicely to implementation with real sensors, but discretizing the world may require a large amount of computer memory and may lead to an inaccurate representation of the world. There are many non heuristic algorithms for which provably correct solutions exist in the ....

J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572-- 577, Cincinnati, Ohio, May 1990.

No context found.

J. Borenstein and J. Koren. Real-time Onstacle Avoidance for Fast Mobile Robots in Cluttered Environments. In IEEE Conference of Robotics and Automation, pages 572--577, Cincinnati, Ohio, May 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC