3D SPATIAL LAYOUTS USING A-TEAMS

Spatial layout is the problem of arranging a set of components in an enclosure such that a set of objectives and constraints is satised. The constraints may include non-interference of objects, accessibility requirements and connection cost limits. Spatial layout problems are found primarily in the domains of electrical engineering and mechanical engineering in the design of integrated circuits and mechanical or electromechanical artifacts. Traditional approaches include ad-hoc (or specialized) heuristics, Genetic Algorithms and Simulated Annealing. The A-Teams approach provides a way of synergistically combining these approaches in a modular agent based fashion. A-Teams are also open to the addition of new agents. Modications in the task requirements translate to modications in the agent mix. In this paper we describe how modular A-Team based optimization can be used to solve 3 dimensional spatial layout problems.

[1]  Anup Kumar,et al.  A Genetic Algorithm for Packing Three-Dimensional Non-Convex Objects Having Cavities and Holes , 1997, ICGA.

[2]  N. M. Aziz,et al.  A computer-aided box stacking model for truck transport and pallets , 1991 .

[3]  Richard W. Quadrel,et al.  Asynchronous design environments: architecture and behavior , 1992 .

[4]  Yukinori Kakazu,et al.  Auto tuning of 3-D packing rules using genetic algorithms , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[5]  Robert W. Haessler,et al.  Load planning for shipments of low density products , 1990 .

[6]  Ho Soo Lee,et al.  Primary production scheduling at steelmaking industries , 1996, IBM J. Res. Dev..

[7]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[8]  Sarosh Talukdar,et al.  Asynchronous Procedures for Parallel Processing , 1983, IEEE Transactions on Power Apparatus and Systems.

[9]  Pedro S. de Souza,et al.  Asynchronous Teams: Cooperation Schemes for Autonomous Agents , 1998, J. Heuristics.

[10]  K. Dowsland.  Some experiments with simulated annealing techniques for packing problems , 1993 .

[11]  Sarosh N. Talukdar.  Autonomous Cyber Agents: Rules For Collaboration , 1998 .

[12]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[13]  Jonathan Cagan,et al.  A Simulated Annealing-Based Approach to Three-Dimensional Component Packing , 1995 .

[14]  Ehl Emile Aarts,et al.  VLSI layout synthesis , 1997 .

[15]  Eduardo Camponogara,et al.  Collaboration strategy for autonomous highly specialized robots , 1997, Other Conferences.

[16]  Pedro S. de Souza,et al.  Asynchronous organizations for multi-algorithm problems , 1993, SAC '93.

[17]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[18]  Sarosh N. Talukdar,et al.  Insects, fish and computer-based super-agents , 1995 .

[19]  Ram D. Sriram,et al.  Solving constraint satisfaction problems using ATeams , 1996, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[20]  R. L. Skinner.  THE PERSONAL FACTOR , 1928 .

[21]  M. Meyer,et al.  A computer-based heuristic for packing pooled shipment containers , 1990 .

[22]  David C. Gossard,et al.  Reasoning on the Location of Components for Assembly Packaging , 1991 .

[23]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[24]  Norman M. Sadeh,et al.  Job-shop-scheduling by a team of asynchronous agents , 1993 .

[25]  S. N. Talukdar,et al.  A Collaboration Strategy for Autonomous , Highly Specialized Agents 1 , 1997 .

[26]  Seshashayee Sankarshana Murthy.  Synergy in cooperating agents: designing manipulators from task specifications , 1992 .

[27]  S. Talukdar,et al.  Automated probabilistic method for assigning backbone resonances of (13C,15N)-labeled proteins , 1997, Journal of biomolecular NMR.