File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Snap-Bounded and Time-Optimal Feedrate Scheduling for Robotic Milling of Complex Surface Parts With Analytical Solution

TitleSnap-Bounded and Time-Optimal Feedrate Scheduling for Robotic Milling of Complex Surface Parts With Analytical Solution
Authors
KeywordsConvex optimization
feedrate scheduling
linear programming
nonlinear model
robotic milling
Issue Date1-Jan-2025
PublisherInstitute of Electrical and Electronics Engineers
Citation
IEEE Transactions on Industrial Informatics, 2025 How to Cite?
AbstractFeedrate scheduling is crucial for improving productivity and accuracy in robotic milling applications. However, due to the nonlinear relationship between the joint space and task space, how to plan a time-optimal feedrate profile with quick analytical solution while ensuring kinematic control up to the snap level remains quite a challenge. To solve these concerns, a snap-bounded and time-optimal feedrate scheduling model is first presented in this article. For accelerating the solving process of the nonlinear model, a synchronous linearization approach is also introduced to help relax the highly nonlinear constraints in both joint space and task space into linear ones. Thereby, the originally complex feedrate scheduling issue is converted to a finite-state convex optimization problem, and an analytical solution to the feedrate profile could be computed efficiently using a straightforward linear programming algorithm. Finally, comparative simulation and experiment are carried out to verify the effectiveness of the proposed method.
Persistent Identifierhttp://hdl.handle.net/10722/362292
ISSN
2023 Impact Factor: 11.7
2023 SCImago Journal Rankings: 4.420

 

DC FieldValueLanguage
dc.contributor.authorChen, Mansen-
dc.contributor.authorSun, Yuwen-
dc.contributor.authorXu, Jinting-
dc.contributor.authorLiu, Jun-
dc.date.accessioned2025-09-22T00:30:08Z-
dc.date.available2025-09-22T00:30:08Z-
dc.date.issued2025-01-01-
dc.identifier.citationIEEE Transactions on Industrial Informatics, 2025-
dc.identifier.issn1551-3203-
dc.identifier.urihttp://hdl.handle.net/10722/362292-
dc.description.abstractFeedrate scheduling is crucial for improving productivity and accuracy in robotic milling applications. However, due to the nonlinear relationship between the joint space and task space, how to plan a time-optimal feedrate profile with quick analytical solution while ensuring kinematic control up to the snap level remains quite a challenge. To solve these concerns, a snap-bounded and time-optimal feedrate scheduling model is first presented in this article. For accelerating the solving process of the nonlinear model, a synchronous linearization approach is also introduced to help relax the highly nonlinear constraints in both joint space and task space into linear ones. Thereby, the originally complex feedrate scheduling issue is converted to a finite-state convex optimization problem, and an analytical solution to the feedrate profile could be computed efficiently using a straightforward linear programming algorithm. Finally, comparative simulation and experiment are carried out to verify the effectiveness of the proposed method.-
dc.languageeng-
dc.publisherInstitute of Electrical and Electronics Engineers-
dc.relation.ispartofIEEE Transactions on Industrial Informatics-
dc.subjectConvex optimization-
dc.subjectfeedrate scheduling-
dc.subjectlinear programming-
dc.subjectnonlinear model-
dc.subjectrobotic milling-
dc.titleSnap-Bounded and Time-Optimal Feedrate Scheduling for Robotic Milling of Complex Surface Parts With Analytical Solution-
dc.typeArticle-
dc.identifier.doi10.1109/TII.2025.3528566-
dc.identifier.scopuseid_2-s2.0-85219677885-
dc.identifier.eissn1941-0050-
dc.identifier.issnl1551-3203-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats