Skip to content
AI News HubLIVE
Original source2 min read

Optimal Operating-Point Selection for Single-Linearization Trajectory Planning of Nonlinear Robot Manipulators

Summary

The paper proposes an offline performance-driven method that treats the location of a single linearization as an optimization variable, selecting the best operating point via grid search and bounded refinement and reducing the nonlinear trajectory objective by 7% to 38% across four UR5 point-to-point motions.

SourcearXiv RoboticsAuthor: Bhanuka Dayawansa, Rohan Munasinghe
Optimal Operating-Point Selection for Single-Linearization Trajectory Planning of Nonlinear Robot Manipulators
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 13 Nov 2026]

Title:Optimal Operating-Point Selection for Single-Linearization Trajectory Planning of Nonlinear Robot Manipulators

View a PDF of the paper titled Optimal Operating-Point Selection for Single-Linearization Trajectory Planning of Nonlinear Robot Manipulators, by Bhanuka Dayawansa and 1 other authors

View PDF HTML (experimental)

Abstract:Single-point linearization provides a computationally efficient basis for optimization-based trajectory planning of nonlinear robot manipulators. However, planning performance depends on the selected linearization point. This paper presents an offline performance-driven approach that treats the location of a single linearization as an optimization variable. Candidate operating points are sampled from a common cubic seed trajectory, and each corresponding affine model is used to solve an identical constrained finite-horizon quadratic program (QP). The resulting control sequences are executed on the original nonlinear dynamics, and the operating point minimizing the nonlinear trajectory objective is selected through grid search and bounded refinement. Evaluation on four point-to-point motions of a three-degree-of-freedom UR5 manipulator yields optimal normalized operating-point locations between 0.325 and 0.935, demonstrating trajectory-dependent selection. Compared with the best-performing conventional initial, midpoint, or terminal linearization, the proposed approach reduces the nonlinear trajectory objective by 17-18%, 21-22%, 37-38%, and 7-8% across the four tasks, respectively. Additional nonlinear execution with identical PID feedback correction confirms that the performance advantage persists for a representative task. These results demonstrate that systematic operating-point selection can substantially improve single-linearization trajectory planning while preserving a fixed affine planning model.

Comments: 6 pages, 5 figures. Accepted for presentation at the 2026 IEEE International Conference on Advances in Computing (IEEE ICAC 2026)

Subjects:

Robotics (cs.RO); Systems and Control (eess.SY)

Cite as: arXiv:2611.18935 [cs.RO]

(or arXiv:2611.18935v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2611.18935

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Bhanuka Dayawansa [view email] [v1] Fri, 13 Nov 2026 20:39:09 UTC (419 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Optimal Operating-Point Selection for Single-Linearization Trajectory Planning of Nonlinear Robot Manipulators, by Bhanuka Dayawansa and 1 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.RO

new | recent | 2026-11

Change to browse by:

cs cs.SY eess eess.SY

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

InvestorsAdvanced

Key points

  • Treats the linearization point in single-linearization trajectory planning as an offline optimization variable.
  • Samples candidate operating points from a common cubic seed trajectory and solves an identical constrained finite-horizon QP for each affine model.
  • Optimal normalized operating points range from 0.325 to 0.935 across four tasks on a three-degree-of-freedom UR5, showing trajectory-dependent selection.
  • Reduces the nonlinear trajectory objective by 17-18%, 21-22%, 37-38%, and 7-8% versus the best conventional initial, midpoint, or terminal linearization.

Highlights and analysis are generated automatically and may contain errors. Check the original source.