A complete S-shaped feedrate scheduling algorithm with variable acceleration limits

A complete S-shaped feedrate scheduling algorithm with variable acceleration limits | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A complete S-shaped feedrate scheduling algorithm with variable acceleration limits YUEBANG HE, TIANLEI WANG, RUICHAO WANG This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4981669/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 4 You are reading this latest preprint version Abstract The conventional S-shaped feedrate scheduling method requires zero starting and ending acceleration to achieve smooth acceleration, which may result in frequent acceleration oscillations in CNC machines, particularly when processing G codes with numerous short length segments. To address this problem, we propose a novel S-shaped algorithm that allows for non-zero starting and ending acceleration, while also accounting for maximum acceleration and maximum velocity constraints. By incorporating this approach along with a bidirectional scanning strategy across all segments, we effectively group them into larger blocks suitable for planning the acceleration from 0 to 0. Subsequently, within each block, a bisection search algorithm is employed to determine the maximum velocity, thereby optimizing the scheduling process. This methodology offers enhanced flexibility by considering varying acceleration limits as well as starting and ending point accelerations across segments within a block, making it more applicable to practical scenarios compared to traditional methods. Simulation and experimental results further validate the effectiveness of our algorithm in reducing machining time without compromising accuracy. Feedrate scheduling bidirectional scanning motion control CNC machine tool Full Text Cite Share Download PDF Status: Under Review Version 1 posted Reviewers agreed at journal 29 Aug, 2024 Reviewers invited by journal 29 Aug, 2024 Editor assigned by journal 28 Aug, 2024 First submitted to journal 26 Aug, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4981669","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":346790300,"identity":"63cbcc4a-eec2-4910-8203-36462d115ee7","order_by":0,"name":"YUEBANG HE","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA7ElEQVRIiWNgGAWjYBACAxDB2AAk2BsfgNg8fMRr4TkMZvOwEa9FIhnMZiCoxZy9x0zi4w67PPnIx4yPeXPsZNgYmB8+uoFHi2XPGTPJmWeSiw1vJzMbztyWDHQYm7FxDj6H3cgxk+ZtY07cODv/mMTHbcxALTxs0ni13H9jJv23rT5x48zDbBKJ2+qJ0HKDx0yase1w4nwJZjagLYeJ0HImrdiy98zxxA08YL8c52FjJuSX44c33vi5ozpxfvthYIhtq7bnZ29++BifFgYGDkh0GByACTDjVQ4C7A/AlHwDQZWjYBSMglEwUgEAX4pHEMgEcAUAAAAASUVORK5CYII=","orcid":"https://orcid.org/0009-0003-3005-8019","institution":"Wuyi University","correspondingAuthor":true,"prefix":"","firstName":"YUEBANG","middleName":"","lastName":"HE","suffix":""},{"id":346790301,"identity":"23b9725e-9109-42af-862d-dc79726ac144","order_by":1,"name":"TIANLEI WANG","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"TIANLEI","middleName":"","lastName":"WANG","suffix":""},{"id":346790302,"identity":"ee4c013f-e7a8-41cf-a79d-714a45baaa82","order_by":2,"name":"RUICHAO WANG","email":"","orcid":"","institution":"","correspondingAuthor":false,"prefix":"","firstName":"RUICHAO","middleName":"","lastName":"WANG","suffix":""}],"badges":[],"createdAt":"2024-08-27 05:37:31","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4981669/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4981669/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":65405163,"identity":"bf859c59-fe46-4ac4-905a-d06cd7cf14af","added_by":"auto","created_at":"2024-09-27 04:30:44","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1924221,"visible":true,"origin":"","legend":"","description":"","filename":"snarticle.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4981669/v1_covered_9d623015-c2c0-44ac-951e-fb7ac84885a5.pdf"}],"financialInterests":"","formattedTitle":"\u003cp\u003eA complete S-shaped feedrate scheduling algorithm with variable acceleration limits\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"the-international-journal-of-advanced-manufacturing-technology","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jamt","sideBox":"Learn more about [The International Journal of Advanced Manufacturing Technology](https://www.springer.com/journal/170)","snPcode":"170","submissionUrl":"https://submission.nature.com/new-submission/170/3","title":"The International Journal of Advanced Manufacturing Technology","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Feedrate scheduling, bidirectional scanning, motion control, CNC machine tool","lastPublishedDoi":"10.21203/rs.3.rs-4981669/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4981669/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The conventional S-shaped feedrate scheduling method requires zero starting and ending acceleration to achieve smooth acceleration, which may result in frequent acceleration oscillations in CNC machines, particularly when processing G codes with numerous short length segments. To address this problem, we propose a novel S-shaped algorithm that allows for non-zero starting and ending acceleration, while also accounting for maximum acceleration and maximum velocity constraints. By incorporating this approach along with a bidirectional scanning strategy across all segments, we effectively group them into larger blocks suitable for planning the acceleration from 0 to 0. Subsequently, within each block, a bisection search algorithm is employed to determine the maximum velocity, thereby optimizing the scheduling process. This methodology offers enhanced flexibility by considering varying acceleration limits as well as starting and ending point accelerations across segments within a block, making it more applicable to practical scenarios compared to traditional methods. Simulation and experimental results further validate the effectiveness of our algorithm in reducing machining time without compromising accuracy.","manuscriptTitle":"A complete S-shaped feedrate scheduling algorithm with variable acceleration limits","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-09-27 04:22:34","doi":"10.21203/rs.3.rs-4981669/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"reviewerAgreed","content":"","date":"2024-08-29T13:05:48+00:00","index":0,"fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-08-29T10:57:49+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-08-28T13:15:06+00:00","index":"","fulltext":""},{"type":"submitted","content":"The International Journal of Advanced Manufacturing Technology","date":"2024-08-27T01:36:51+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"the-international-journal-of-advanced-manufacturing-technology","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jamt","sideBox":"Learn more about [The International Journal of Advanced Manufacturing Technology](https://www.springer.com/journal/170)","snPcode":"170","submissionUrl":"https://submission.nature.com/new-submission/170/3","title":"The International Journal of Advanced Manufacturing Technology","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"459d3c03-fdc1-4e72-9d73-0c474db5ca42","owner":[],"postedDate":"September 27th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2024-09-27T04:22:35+00:00","versionOfRecord":[],"versionCreatedAt":"2024-09-27 04:22:34","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4981669","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4981669","identity":"rs-4981669","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}