#5223. Dwell Time Algorithm Based on Bounded Constrained Least Squares Under Dynamic Performance Constraints of Machine Tool in Deterministic Optical Finishing

September 2026publication date
Proposal available till 08-06-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Engineering
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2510 $1340 $1170 $1000 $
Contract №5223.1 Contract №5223.2 Contract №5223.3 Contract №5223.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
The dwell time algorithm is one of the most important techniques within the deterministic optical surfacing technologies. The existing dwell time algorithms are generally based on non-negative least squares (NNLS) without considering the dynamic performance constraints of machine tools. This is a circumstance that leads to poor convergence accuracy. In this paper, a dwell time algorithm, based on bounded constrained least-squares (BCLS) under dynamic performance constraints of the machine tool, has been developed. The upper and lower constraints of the dwell time model could be derived through the acceleration and deceleration mechanism of the CNC (Computer Numerical Control) machine tools. A two-metric projection Newton iteration algorithm was used to solve the large-scale dwell time model, which greatly improved the computation efficiency.
Keywords:
Bounded constrained total least squares; Deterministic polishing technologies; Dwell time algorithm; Magnetorheological finishing

Contacts :
0