Some twenty years have elapsed since the first attempts at planning were made by researchers in artificial intelligence. These early programs concentrated on the development of plans for the solution of puzzles or toy problems, like the rearrangement of stacks of blocks. These early programs provided the foundation for the work described in this book, the automatic generation of plans for industrial assembly. As one reads about the complex and sophisticated planners in the current gen- eration, it is important to keep in ...
Read More
Some twenty years have elapsed since the first attempts at planning were made by researchers in artificial intelligence. These early programs concentrated on the development of plans for the solution of puzzles or toy problems, like the rearrangement of stacks of blocks. These early programs provided the foundation for the work described in this book, the automatic generation of plans for industrial assembly. As one reads about the complex and sophisticated planners in the current gen- eration, it is important to keep in mind that they are addressing real-world problems. Although these systems may become the "toy" systems of tomor- row, they are providing a solid foundation for future, more general and more advanced planning tools. As demonstrated by the papers in this book, the field of computer-aided mechanical assembly planning is maturing. It now may include: - geometric descriptions of parts extracted from or compatible with CAD programs; - constraints related to part interference and the use of tools; - fixtures and jigs required for the assembly; - the nature of connectors, matings and other relations between parts; - number of turnovers required during the assembly; - handling and gripping requirements for various parts; - automatic identification of subassemblies. This is not an exhaustive list, but it serves to illustrate the complexity of some of the issues which are discussed in this book. Such issues must be considered in the design of the modern planners, as they produce desirable assembly sequences and precedence relations for assembly.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 446 p. The Springer International Engineering and Computer Science, 148. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 446 p. The Springer International Engineering and Computer Science, 148. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 446 p. The Springer International Engineering and Computer Science, 148. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
