Chuangqi Wang

Learn More
Finding paths in difficult regions of C-space, such as narrow passages and configuration obstacle boundaries, is a rather challenging problem for path planning in changing environments. When obstacles move in W-space, these regions in C-space will change their edge points from free to collision or on the contrary, for which a “Capacitor”(More)
Automatic path planning has many applications in robotics, computer-aided design(CAD) and industrial manipulation. The property of safety is vital but seldom taken into consideraion by typical path planning. In this paper, collision probability is introduced as an evaluation of crowd degree of environments to get a safer path. The smaller collision(More)
For changing environments, although lots of planning algorithms have focused on how to get a valid and short path, seldom planning algorithms can be employed to extract a sustaining valid path. Especially for large-scale environments, getting a sustaining valid path is required to make intelligent decisions for robots. In this paper, a method of Path(More)
  • 1