Arrow Research search

Author name cluster

Lei Lv

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
2 author rows

Possible papers

2

ICRA Conference 2025 Conference Paper

Multi-Segment Soft Robot Control Via Deep Koopman-Based Model Predictive Control

  • Lei Lv
  • Lei Liu 0076
  • Lei Bao
  • Fuchun Sun 0001
  • Jiahong Dong
  • Jianwei Zhang 0001
  • Xuemei Shan
  • Kai Sun

Soft robots, compared to regular rigid robots, as their multiple segments with soft materials bring flexibility and compliance, have the advantages of safe interaction and dexterous operation in the environment. However, due to its characteristics of high dimensional, nonlinearity, time-varying nature, and infinite degree of freedom, it has been challenges in achieving precise and dynamic control such as trajectory tracking and position reaching. To address these challenges, we propose a framework of Deep Koopman-based Model Predictive Control (DK-MPC) for handling multi-segment soft robots. We first employ a deep learning approach with sampling data to approximate the Koopman operator, which therefore linearizes the high-dimensional nonlinear dynamics of the soft robots into a finite-dimensional linear representation. Secondly, this linearized model is utilized within a model predictive control framework to compute optimal control inputs that minimize the tracking error between the desired and actual state trajectories. The real-world experiments on the soft robot “Chordata” demonstrate that DK-MPC could achieve highprecision control, showing the potential of DK-MPC for future applications to soft robots. More visualization results can be found at https://pinkmoon-io.github.io/DKMPC/.

EAAI Journal 2024 Journal Article

Mixed-integer linear programming and composed heuristics for three-stage remanufacturing system scheduling problem

  • Wenjie Wang
  • Guangdong Tian
  • Honghao Zhang
  • Zhiwu Li
  • Lei Lv
  • Cheng Li

The three-stage remanufacturing system scheduling problem (3T-RSSP) has been a hot research topic recently. The remanufacturing system in this paper is equipped with a novel configuration of unrelated parallel disassembly/reassembly workstations and parallel dedicated flow-shop-type reprocessing lines. To this end, a mixed-integer linear programming (MILP) model based on the adjacent sequence-based modeling idea is first proposed to address the 3T-RSSP for a makespan minimization. Compared with other ideas, the adjacent sequence-based modeling idea is effective in deciding precedence relationship between two adjacent operations, especially for the investigated 3T-RSSP. The 3T-RSSP is NP (non-deterministic polynomial)-hard, we also design 18 composed heuristics for large-sized problems to gain a better performance, compared to traditional isolated heuristics. Simulation experiments are carried out on a publicly available dataset to test the performance the MILP model and composed heuristics. Results imply that the MILP model solved by CPLEX can seek optimum solutions within a short time when the problem size is small. It is found that when problem size becomes 2. 0, 4. 0, 8. 0 times large, performance indicators NCs (number of constraints) and NBVs (number of binary variables) of the model become 3. 29, 11. 81, 44. 60 and 3. 43, 12. 57, 48. 00 times large. Besides, compared with other composed heuristics, LTRT-F (longest total reprocessing time-first available machine) gains the best performance. Instance P5-C3-D2/A2 is selected to quantitatively analyze the MILP model by presenting the detailed 0–1 binary variable values. Finally, by comparing with position-based MILP model, the adjacent sequence-based MILP model has better performance in characterizing the investigated 3T-RSSP.

v2026.09.13