The 2005 DARPA Grand Challenge is a 132 mile race through the desert with autonomous robotic vehicles. Lasers mounted on the car roof provide a map of the road up to 20 meters ahead of the car but the car needs to see further in order to go fast enough to win the race. Computer vision can extend that map of the road ahead but desert road is notoriously similar to the surrounding desert. The CAR...

This paper focuses on an interdisciplinary approach using Geoinformation Science and Technology, Operations Research and Forest Science to overcome the limitations of the traditional forest road planning process. A pilot study shows that combining Geoinformation Science and Technology and Operations Research supports forest road planning. The first research objective solved in the project is th...

We describe an efficient method for planning in environments for which prior maps are plagued with uncertainty. Our approach processes the map to determine key areas whose uncertainty is crucial to the planning task. It then incorporates the uncertainty associated with these areas using the recently developed PAO* algorithm to produce a fast, robust solution to the original planning task.

In order to estimate proper current land price, various factors such as environment, communication, regulation of land use and so on are established by local government. Road slope is one of the land price factors for land form, and land price is corrected by road slope aspect based on road slope for the north. For example, road slope aspect is corrected so that land price face to northern slop...

In January 2006, the CJHP Editorial Board, as well as members of CSHP Council and staff, selected individuals from the Society’s general membership (including students), and representatives of both the CSHP Research and Education Foundation and the American Journal of Health-System Pharmacy participated in a day-long strategic businessplanning session for the CJHP. In conjunction with an enviro...

We propose to design motion planning algorithms with a strong form of resolution completeness, called resolution-exactness. Such planners can be implemented using soft predicates within the subdivision paradigm. The advantage of softness is that we avoid the Zero problem and other issues of exact computation. Soft Subdivision Search (SSS) is an algorithmic framework for such planners. There are...