NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
This paper discusses and evaluates an obstacle detection algorithm developed at NIST in support of the DEMO III Unmanned Ground Vehicle (UGV) program. The algorithm is a hybrid of grid-based and sensor-based obstacle detection and mapping techniques and is implemented as a module of the integrated 4D-Realtime Control System (RCS) system. The module consists of two sections: An obstacle detection section that processes range data read from a ladar sensor and uses this information to detect obstacles. A mapping section that projects obstacle points onto a grid-based representation map used to generate a traversable path for the vehicle.We describe the sensors used in the 4D-RCS autonomous driving system, the laser range finder (Ladar) sensor's characteristics, the obstacle detection algorithm, and the obstacle mapping procedure. We next evaluate the algorithm's performance on both man-made and natural obstacles. We have demonstrated autonomous driving with obstacle detection and avoidance on the NIST GROUNDS AND THE Nike site at speeds of up to 15 miles per hour.
Tsai-Hong, H.
, Legowik, S.
and Nashman, M.
(1998),
Obstacle Detection and Mapping System, NIST Interagency/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=820625
(Accessed October 10, 2025)