0
TECHNICAL PAPERS

Constraint-Based Design of Optimal Transport Elements

[+] Author and Article Information
Michael Drumheller

The Boeing Company, Mathematics and Computing Technology, P.O. Box 3707, M/S 7L-40, Seattle, WA, 98124e-mail: michael.drumheller@boeing.com

J. Comput. Inf. Sci. Eng 2(4), 302-311 (Mar 26, 2003) (10 pages) doi:10.1115/1.1554698 History: Received September 01, 2002; Revised December 01, 2002; Online March 26, 2003
Copyright © 2002 by ASME
Topics: Design
Your Session has timed out. Please sign back in to continue.

References

Jain,  D., Unemori,  A., Chatterjee,  M., and Thangam,  N., 1992, “A Knowledge-Based Automatic Pipe Routing System,” ASME Comput. Eng., 1, pp. 127–132.
Mitsuta, T., Wada, Y., Kobayashi, Y., and Kiguchi, T., 1986, “A Knowledge-Based Approach to Routing Problems in Industrial Plant Design,” In 6th International Workshop on Expert Systems and Applications, pp. 237–255, Avignon, France.
Zhu, D., and Latombe, J.-C., 1991, “Mechanization of Spatial Reasoning for Automatic Pipe Layout Design,” AI EDAM 5(1), pp. 1–20.
Zhu, D., and Latombe, J. C., 1991, Pipe Routing=Path Planning (With Many Constraints). In Proc. IEEE Intl. Conf. Robotics and Automation, Sacramento, CA.
Bohle,  D., Jakobs,  G., Hänisch,  K., and Kalbitz,  H., 1982, “Rechnerunterstützung bei der Rohrleitungs-Konstruktion im 3D-Raum. (Computer-assisted pipe routing in 3-D space.)” Chem.-Ing.-Tech., 54(3), pp. 241–246. (In German.)
Satyanarayana, M. V. V., Rao, A. A., et al. 1992, “An Automated Pipe-Route Planner in Three Dimensional Plant Layout Design,” Proc. CompEuro ’92, Computer Systems and Software Engineering, IEEE-0-8186-2760-3/92.
Wangdahl,  G. E., Pollock,  S. M., and Woodward,  J. B., 1974, “Minimum-trajectory Pipe Routing,” J. Ship Res., 18(1), pp. 46–49, March.
OptiPlant, 2002, by ASD Global, Inc. (USA). http://www.asdglobal.com.
Szykman,  S., and Cagan,  J., 1996, “Synthesis of Optimal Non-Orthogonal Routes,” ASME J. Mech. Des., 118(3), pp. 419–424.
Conru, A. B., and Cutkosky, M. R., 1993, “Computational Support for Interactive Cable Harness Routing and Design,” ASME DE-Vol. 65-1, Adv. in Design Automation, Vol. 1, pp. 551–558.
Conru, A. B., 1994, “A Genetic Approach to the Cable Harness Routing Problem,” In Proc. First IEEE Conf. on Evolutionary Comp., IEEE 0-7803-1899-4/94, pp. 200–205, Orlando, FL.
Latombe, Jean-Claude. Robot Motion Planning. Kluwer International Series in Engineering and Comp. Sci., 124, 1990.
J.-P. Laumond (Ed.), 1998, Robot Motion Planning and Control. Previously published as “Lecture Notes in Control and Information Sciences 229,” Springer, SIBN 3-540-76219-1, 343p. Out of print but available free of charge at http://www.laas.fr/jpl/book-toc.html.
Sussman, H. J., 1995, “Shortest Three-dimensional Paths with a Prescribed Curvature Bound,” In Proc. 34th IEEE Conf. Decision and Control, New Orleans, LA, Dec.
Laumond,  J.-P., Jacobs,  P. E., Taix,  M., and Murray,  R. M., 1994, “A Motion Planner for Nonholonomic Mobile Robots,” IEEE Trans. Rob. Autom., 10(5), pp. 577–593, October.
Quinlan, S., and Khatib, O., 1993, “Elastic bands: Connecting path planning and control,” Proc. IEEE Intl. Conf. Robotics and Automation.
Wei, Y. F., and Thornton, A. C., 2000, “Tube Production and Assembly Systems: The Impact of Compliance and Variability on Yield,” In Proc. ASME Des. Automation Conf, DETC2000/DAC-14271, Sep.
TubeExpert Corp. (Ger.) http://www.tubeexpert.com, 2002.
Eagle Precision Technology, Inc. (USA) http:/www.eaglept.com, 2002.
CATIA by Dassault Systemes (France) http://www.dsweb.com, 2002.
XpresRoute and PathXpres by Solid Edge, Inc. (USA) http://www.solid-edge.com, 2002.
Das,  I., and Dennis,  J. E., 1998, “Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems,” SIAM J. Optim., 8(3), pp. 631–657.
Audet, C., and Dennis J. E., Jr., 1999, “Pattern Search Algorithms for Mixed-variable Programming,” Technical Report TR99-02, Dept. of Comp. and App. Math., Rice University.
Goux, J. P., and Leyffer, S., 2001, Solving Large MINLPs on Computational Grids. Tech. Report NA/200, U. Dundee.
Duda, R. O., and Hart, P. E., 1973, Pattern Classification and Scene Analysis. Wiley, New York.
Friedman, J. H., 1990, “Multivariate Adaptive Regression Splines,” PUB 4960, Tech. Rep. 102, Stanford Linear Accelerator Center, Stanford University.
Orr,  M., Takezawa,  K., Hallam,  J. 2000, “Combining Regression Trees and Radial Basis Function Networks,” Int. J. Neural Syst., 10(6), pp. 453–465.
Stanford Business Software, Inc. (USA) http://www.sbsi-sol-optimize.com, 2002.
Gill, P. E., Murray, W., and Wright, M. H., 1981, Practical Optimization. Academic Press, London.
Concert Technology by ILOG, Inc. (USA) http://www.ilog.com, 2002.
EZMod by Modellium Corp. (France) http://www.modellium.com, 2002.
Agarwal,  P. K., and Wang,  H., 2001, “Approximation Algorithms for Curvature-constrained Shortest Paths,” SIAM J. Comput., 30(6), pp. 1739–1772.
Dubins,  L. E., 1957, “On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents,” Am. J. Math., 79, pp. 497–516.
Venditelli,  M., Laumond,  J. P., and Nissoux,  C., 1999, “Obstacle Distance for Car-like Robots,” IEEE Trans. Rob. Autom., 15(4), pp. 678–691.
Betts,  J. T., and Huffman,  W. P., 1993, “Path-Constrained Trajectory Optimization Using Sparse Sequential Quadratic Programming,” J. Guid. Control Dyn., 16(1), pp. 59–68, January-February.
Betts,  J. T., 1998, “Survey of Numerical Methods for Trajectory Optimization,” AIAA J., Guidance, Control, Dynam. 21(2), pp. 193–207, March-April.
Shald, S. M., 1997, “Arcline Guidance,” Master’s thesis, University of Minnesota.
Betts, John, and Frank, Paul, OPTLIB and SOCS Math & Information Software, the Boeing Company, http://www.boeing.com/phantom/math_infosw, 2002.
Betts, J. T., and Frank, P. D., 2001, “OPTLIB: Optimization and Optimal Control Software Library,” Boeing Information and Support Services—Mathematics and Computing Technology Report M&CT-TECH-01-014, The Boeing Company, P.O. Box 3707, Seattle, WA 98124-2207.
Frisken, S. F., Perry, R. N., Rockwood, A. P., and Jones, T. R., 2000, “Adaptively Sampled Distance Fields: A General Representation of Shape for Computer Graphics,” Mitsubishi Electric Research Laboratory, TR2002-15, Cambridge, MA, April.

Figures

Grahic Jump Location
Nodes make poor control points
Grahic Jump Location
A single node distribution may not be able to accommodate all changes in the background
Grahic Jump Location
Sleeves for pseudo-parallel routing
Grahic Jump Location
A single high-level constraint implies many “primitive” constraints
Grahic Jump Location
Constraint relationships may enforce similar conditions at disparate locations
Grahic Jump Location
Salience ranking and easy pass
Grahic Jump Location
Potential benefit of look-ahead
Grahic Jump Location
Alternative node distributions
Grahic Jump Location
Pseudo-parallel tubes in a wheel well
Grahic Jump Location
Expansion loop (A) before and (B) after imposition of stay-out zones
Grahic Jump Location
Tube passing through two stiffening webs (A) with and (B) without equal incidence angles
Grahic Jump Location
A timing example (see Table 1)

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In