Abstract
This paper presents a symbolic solution to a piano movers’ problem with four parameters through investigating the positive definiteness of an even polynomial of degree 8 and the feasibility of certain inequality systems.
This work is supported in part by NKBRSF-2004CB318003 and NNSFC-10471044.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caviness, B.F., Johnson, J.R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Proceedings of the symposium held at the Research Institute for Symbolic Computation, Johannes Kepler University, Linz. Texts and Monographs in Symbolic Computation. Springer, Vienna (1998)
Davenport, J.H., Siret, Y., Tournier, E.: Computer Algebra: Systems and Algorithms for Algebraic Computation, 2nd edn., pp. 138–139. Academic Press, London (1993)
Feinberg, E.B., Papadimitriou, C.H.: Finding Feasible Points for a Two-point Body. J. Algorithms 10, 109–119 (1989)
Finch, S.R.: Moving Sofa Constant. In: Mathematical Constants, pp. 519–523. Cambridge University Press, Cambridge (2003)
Iba, H., Tohge, T., Inoue, Y.: Cooperative Transportation by Humanoid Robots — Solving Piano Movers’ Problem. Int. J. Hybrid Intell. Syst. 1(4), 189–201 (2004)
Hong, H.: Quantifier Elimination in Elementary Algebra and Geometry by Partial Cylindrical Algebra Decomposition (QEPCAD) version B 1.44, http://www.cs.usna.edu/~qepcad/
Lengyil, J., Reichert, M., Dolnald, B.R., Greenberg, D.P.: Real Time Robot Motion Planning Using Rasterizing Computer Graphics Hardware. In: Computer Graphics (SIGGRAPH 1990 Proceedings), vol. 24(4), pp. 327–335 (1990)
Leven, D., Sharir, M.: An Efficient and Simple Motion Planning Algorithm for a Ladder Moving in Two-Dimensional Space Amidst Polygonal Barriers. J. Algorithms 8, 192–215 (1987)
Schwartz, J.T., Sharir, M.: On the Piano Movers’ Problem I: The Case of a Rigid Polygonal Body Moving Amidst Polygonal Barriers. Comm. Pure Appl. Math. 36, 345–398 (1983)
Schwartz, J.T., Sharir, M.: On the Piano Movers’ Problem II: General Techniques for Computing Topological Properties of Real Algebraic Manifolds. Adv. Appl. Math. 4(3), 298–351 (1983)
Wang, D.: Geometry Machines: From AI to SMC. In: Pfalzgraf, J., Calmet, J., Campbell, J. (eds.) AISMC 1996. LNCS, vol. 1138, pp. 213–239. Springer, Heidelberg (1996)
Yang, L., Hou, X., Zeng, Z.: A Complete Discrimination System for Polynomials. Sci. China Ser. E 39(6), 628–646 (1996)
Yang, L., Zhang, J.: A Practical Program of Automated Proving for a Class of Geometric Inequalities. In: Richter-Gebert, J., Wang, D. (eds.) ADG 2000. LNCS (LNAI), vol. 2061, pp. 41–57. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, L., Zeng, Z. (2006). Symbolic Solution of a Piano Movers’ Problem with Four Parameters. In: Hong, H., Wang, D. (eds) Automated Deduction in Geometry. ADG 2004. Lecture Notes in Computer Science(), vol 3763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11615798_5
Download citation
DOI: https://doi.org/10.1007/11615798_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31332-8
Online ISBN: 978-3-540-31363-2
eBook Packages: Computer ScienceComputer Science (R0)