Symbolic solution of a piano movers' problem with four parameters

Authors:
Lu Yang;Zhenbing Zeng
Affiliations:
East China Normal University, Shanghai, China;East China Normal University, Shanghai, China
Venue:
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Year:
2004

Citing 7
Cited 0

An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers

Journal of Algorithms
Finding feasible paths for a two-point body

Journal of Algorithms
Real-time robot motion planning using rasterizing computer graphics hardware

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Computer algebra (2nd ed.): systems and algorithms for algebraic computation

Computer algebra (2nd ed.): systems and algorithms for algebraic computation
A Practical Program of Automated Proving for a Class of Geometric Inequalities

ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Geometry Machines: From AI to SMC

AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
Cooperative Transportation by Humanoid Robots - Solving Piano Movers' Problem

International Journal of Hybrid Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

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.