Mechanization of spatial reasoning for automatic pipe layout design

Artificial Intelligence has been very active in developing high-level symbolic reasoning paradigms that have resulted in practical expert systems. However, with a few exceptions, it has paid little attention to the automation of spatial reasoning. On the other hand, spatial reasoning has attracted the interest of several researchers in Robotics. One of the important problems that have been investigated is motion planning, and very significant results have been obtained. This paper describes an implemented system for designing pipe layouts automatically using motion planning techniques. It introduces a new approach to pipe layout design automation in which pipe routes are treated as trajectories left behind by rigid objects (‘robots’). We have implemented this approach in a basic Pipe Router that is described in detail in this paper. We have extended this router in order to make it capable of treating a variety of other constraints which are typical of practical pipe layout design problems. These constraints relate to the process carried out in the pipes, to the design of their mechanical support, and to the constructability and the ease of operation and maintenance of the designed pipe systems.

[1]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[2]  Yasuhiro Kobayashi,et al.  Knowledge Representation and Utilization for Optimal Route Search , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Balas K. Natarajan,et al.  Some Paradigms for the Automated Design of Parts Feeders , 1989, Int. J. Robotics Res..

[4]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[5]  J. Latombe,et al.  On nonholonomic mobile robots and optimal maneuvering , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[6]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[7]  Jean-Claude Latombe,et al.  Failure Processing in a System for Designing Complex Assemblies , 1979, IJCAI.

[8]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[9]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[10]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[11]  Harry C. Sheridan AN OVER VIEW OF A CASDAC SUBSYSTEM—COMPUTER‐AIDED PIPING DESIGN AND CONSTRUCTION (CAPDAC) , 1976 .

[12]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[13]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[14]  Bruce Randall Donald,et al.  On the motion of compliantly-connected rigid bodies in contact. II. A system for analyzing designs for assembly , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[15]  J. Davenport A "Piano Movers" Problem. , 1986 .

[16]  Randall H. Wilson,et al.  Maintaining geometric dependencies in an assembly planner , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[17]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[19]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[20]  S. Jiaoying,et al.  Artificial intelligence in computer aided design , 1987 .

[21]  Gordon T. Wilfong,et al.  Planning constrained motion , 1988, STOC '88.

[22]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[23]  Jean-Paul Laumond,et al.  Finding Collision-Free Smooth Trajectories for a Non-Holonomic Mobile Robot , 1987, IJCAI.

[24]  Yasuhiro Kobayashi,et al.  A knowledge-based approach to routing problems in industrial plant design , 1987 .

[25]  Jean-Claude Latombe,et al.  New heuristic algorithms for efficient hierarchical path planning , 1991, IEEE Trans. Robotics Autom..

[26]  Stephen M. Pollock,et al.  MINIMUM-TRAJECTORY PIPE ROUTING , 1974 .

[27]  B. Faverjon,et al.  A practical approach to motion-planning for manipulators with many degrees of freedom , 1991 .

[28]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[29]  D. J. Gunn,et al.  Computer-aided layout of chemical plant: a computational method and a case study , 1987 .