Xin Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xin Li has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Lei Wang
School of Mathematical Sciences, Dalian University of Technology, Dalian, China
3 shared publications - Ye Ji
Delft University of Technology
3 shared publications - Ying-Ying Yu
School of Mathematics, Liaoning Normal University, Dalian 116029, China
3 shared publications - Chen Lu
Hangzhou International Innovation Institute, Beihang University, Hangzhou, China
2 shared publications - Xichao Su
School of Aviation Operation and Support, Naval Aviation University, Yantai 264001, China
2 shared publications - Xinwei Wang
Department of Engineering Mechanics, Dalian University of Technology, Dalian 116024, China
2 shared publications
Latest Publications
- Open Access
- 14 March 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 485
Regularity analysis and verification of Coons volume mappings
- 14 March 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 485
Open AccessRegularity analysis and verification of Coons volume mappings
- 18 November 2025
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 43 (03)
Scheduling for Carrier Aircraft Hangar Maintenance in Wave Missions Involving Chance Constraints
In modern naval operations, the efficient scheduling of carrier aircraft hangar maintenance under wave-mission constraints is critical for sustaining fleet readiness and combat effectiveness. Existing methods often lack adaptability to dynamic disruptions and fail to explicitly account for operational uncertainty. This paper presents an integrated optimization and rescheduling framework tailored for carrier aircraft hangar maintenance in wave missions. First, a Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP) model is developed, incorporating chance constraints to explicitly address the probabilistic nature of wave-launch timing. The model aims to simultaneously maximize wave-mission completion and fleet wave availability, ensuring robust decision-making under uncertainty. Second, a priority-based encoding structure and a dual-layer decoding mechanism are designed to efficiently represent the scheduling problem. Building on this encoding, a Hybrid Particle Swarm Optimization (HPSO) algorithm is proposed, integrating genetic algorithm-inspired crossover and elite replacement strategies to enhance global exploration and convergence speed. Furthermore, a rapid rescheduling strategy leveraging the same encoding architecture is introduced to seamlessly adjust schedules in response to unexpected events such as personnel reassignments or equipment failures. Comprehensive simulations demonstrate that the proposed approach significantly improves scheduling flexibility and robustness. Compared to traditional algorithms, HPSO consistently generates high-quality solutions within seconds, maintaining optimal wave-task completion and fleet availability even after disruptions. This research provides a practical and intelligent decision-support tool for carrier aircraft maintenance scheduling, with potential applications extending to other resource-constrained project environments.
- 18 November 2025
- Published by World Scientific Pub Co Pte Ltd in Asia-Pacific Journal of Operational Research
- Vol. 43 (03)
Scheduling for Carrier Aircraft Hangar Maintenance in Wave Missions Involving Chance Constraints
In modern naval operations, the efficient scheduling of carrier aircraft hangar maintenance under wave-mission constraints is critical for sustaining fleet readiness and combat effectiveness. Existing methods often lack adaptability to dynamic disruptions and fail to explicitly account for operational uncertainty. This paper presents an integrated optimization and rescheduling framework tailored for carrier aircraft hangar maintenance in wave missions. First, a Multi-Skilled Resource-Constrained Project Scheduling Problem (MSRCPSP) model is developed, incorporating chance constraints to explicitly address the probabilistic nature of wave-launch timing. The model aims to simultaneously maximize wave-mission completion and fleet wave availability, ensuring robust decision-making under uncertainty. Second, a priority-based encoding structure and a dual-layer decoding mechanism are designed to efficiently represent the scheduling problem. Building on this encoding, a Hybrid Particle Swarm Optimization (HPSO) algorithm is proposed, integrating genetic algorithm-inspired crossover and elite replacement strategies to enhance global exploration and convergence speed. Furthermore, a rapid rescheduling strategy leveraging the same encoding architecture is introduced to seamlessly adjust schedules in response to unexpected events such as personnel reassignments or equipment failures. Comprehensive simulations demonstrate that the proposed approach significantly improves scheduling flexibility and robustness. Compared to traditional algorithms, HPSO consistently generates high-quality solutions within seconds, maintaining optimal wave-task completion and fleet availability even after disruptions. This research provides a practical and intelligent decision-support tool for carrier aircraft maintenance scheduling, with potential applications extending to other resource-constrained project environments.
- Open Access
- 14 May 2025
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (8) , 1-34
Carrier platform-enhanced multiple-UAV cooperative task assignment with dual heterogeneities
- 14 May 2025
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (8) , 1-34
Open AccessCarrier platform-enhanced multiple-UAV cooperative task assignment with dual heterogeneities
- Open Access
- 28 April 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (9) , 1344
On Intersections of B-Spline Curves
Bézier and B-spline curves are foundational tools for curve representation in computer graphics and computer-aided geometric design, with their intersection computation presenting a fundamental challenge in geometric modeling. This study introduces an innovative algorithm that quickly and effectively resolves intersections between Bézier and B-spline curves. The number of intersections between the two input curves within a specified region is initially determined by applying the resultant of a polynomial system and Sturm’s theorem. Subsequently, the potential region of the intersection is established through the utilization of the pseudo-curvature-based subdivision scheme and the bounding box detection technique. The projected Gauss-Newton method is ultimately employed to efficiently converge to the intersection. The robustness and efficiency of the proposed algorithm are demonstrated through numerical experiments, demonstrating a speedup of 3 to 150 times over traditional methods.
- 28 April 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (9) , 1344
Open AccessOn Intersections of B-Spline Curves
Bézier and B-spline curves are foundational tools for curve representation in computer graphics and computer-aided geometric design, with their intersection computation presenting a fundamental challenge in geometric modeling. This study introduces an innovative algorithm that quickly and effectively resolves intersections between Bézier and B-spline curves. The number of intersections between the two input curves within a specified region is initially determined by applying the resultant of a polynomial system and Sturm’s theorem. Subsequently, the potential region of the intersection is established through the utilization of the pseudo-curvature-based subdivision scheme and the bounding box detection technique. The projected Gauss-Newton method is ultimately employed to efficiently converge to the intersection. The robustness and efficiency of the proposed algorithm are demonstrated through numerical experiments, demonstrating a speedup of 3 to 150 times over traditional methods.
- Open Access
- 17 March 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (6) , 882
On Self-Intersections of Cubic Bézier Curves
Cubic Bézier curves are widely used in computer graphics and geometric modeling, favored for their intuitive design and ease of implementation. However, self-intersections within these curves can pose significant challenges in both geometric modeling and analysis. This paper presents a comprehensive approach to detecting and computing self-intersections of cubic Bézier curves. We introduce an efficient algorithm that leverages both the geometric properties of Bézier curves and numerical methods to accurately identify intersection points. The self-intersection problem of cubic Bézier curves is firstly transformed into a quadratic problem by eliminating trivial solutions. Subsequently, this quadratic system is converted into a linear system that may be easily analyzed and solved. Finally, the parameter values corresponding to the self-intersection points are computed through the solution of the linear system. The proposed method is designed to be robust and computationally efficient, making it suitable for real-time applications.
- 17 March 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (6) , 882
Open AccessOn Self-Intersections of Cubic Bézier Curves
Cubic Bézier curves are widely used in computer graphics and geometric modeling, favored for their intuitive design and ease of implementation. However, self-intersections within these curves can pose significant challenges in both geometric modeling and analysis. This paper presents a comprehensive approach to detecting and computing self-intersections of cubic Bézier curves. We introduce an efficient algorithm that leverages both the geometric properties of Bézier curves and numerical methods to accurately identify intersection points. The self-intersection problem of cubic Bézier curves is firstly transformed into a quadratic problem by eliminating trivial solutions. Subsequently, this quadratic system is converted into a linear system that may be easily analyzed and solved. Finally, the parameter values corresponding to the self-intersection points are computed through the solution of the linear system. The proposed method is designed to be robust and computationally efficient, making it suitable for real-time applications.
- 10 August 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 235
Dynamic path planning of mobile robots using adaptive dynamic programming
- 10 August 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 235
Dynamic path planning of mobile robots using adaptive dynamic programming
- Open Access
- 1 January 2019
- Published by Elsevier in Earthquake Science
- Vol. 32 (3-4) , 115-124
Stochastic simulation of ground motions based on NGA-West2 strong motion records
Stochastic modeling of ground motion is a simple tool to predict ground shaking level for future earthquake and less time consuming than physics-based deterministic modeling. In this paper, a record-based stochastic method that considers the time- and frequency-evolution of ground motion is used to estimate ground motion for scenario earthquakes in tectonic active region. The stochastic method employs a time-domain modulation function to describe the temporal nonstationarity and a filter impulse response function that describe the evolution of frequency content. For characterizing the modulation function and the filter impulse function, six parameters (Ia, D5-95, tmid, ωmid, ω', ξf) are defined, and 2,571 pairs of ground motion recording in the NGA-west2 database are selected to identify the six parameters. Probabilistic density function is assigned to each of the parameter by fitting the frequency distribution histogram. The parameters are then transformed into standard normal space where regression analysis is performed by considering each parameter as function of moment magnitude, rupture distance, vS30 (The time-averaged shear wave velocity of the top 30 m of soil). The prediction equations are used to generate ground motions for several scenario earthquakes and compared to NGA-West2 GMPEs.
- 1 January 2019
- Published by Elsevier in Earthquake Science
- Vol. 32 (3-4) , 115-124
Open AccessStochastic simulation of ground motions based on NGA-West2 strong motion records
Stochastic modeling of ground motion is a simple tool to predict ground shaking level for future earthquake and less time consuming than physics-based deterministic modeling. In this paper, a record-based stochastic method that considers the time- and frequency-evolution of ground motion is used to estimate ground motion for scenario earthquakes in tectonic active region. The stochastic method employs a time-domain modulation function to describe the temporal nonstationarity and a filter impulse response function that describe the evolution of frequency content. For characterizing the modulation function and the filter impulse function, six parameters (Ia, D5-95, tmid, ωmid, ω', ξf) are defined, and 2,571 pairs of ground motion recording in the NGA-west2 database are selected to identify the six parameters. Probabilistic density function is assigned to each of the parameter by fitting the frequency distribution histogram. The parameters are then transformed into standard normal space where regression analysis is performed by considering each parameter as function of moment magnitude, rupture distance, vS30 (The time-averaged shear wave velocity of the top 30 m of soil). The prediction equations are used to generate ground motions for several scenario earthquakes and compared to NGA-West2 GMPEs.
- 25 June 2017
- Published by ASME International
Analytical Method of Buried Steel Pipelines Subjected to Strike-Slip Faults
Based on the summary of the existing analytical methods of buried steel pipelines at crossings with active strike-slip faults, an improved analytical methodology herein is proposed. Based on Karamitros model, the Ramberg-Osgood stress-strain relationships of pipe steel and the effects of nonlinear soil-pipeline interaction in both the axial and transverse directions are taken into account. Compared with existing analytical methodologies and 3D nonlinear finite element analysis, the analytical methodology presented is suitable for engineering applications due to exact and conservative results.
- 25 June 2017
- Published by ASME International
Analytical Method of Buried Steel Pipelines Subjected to Strike-Slip Faults
Based on the summary of the existing analytical methods of buried steel pipelines at crossings with active strike-slip faults, an improved analytical methodology herein is proposed. Based on Karamitros model, the Ramberg-Osgood stress-strain relationships of pipe steel and the effects of nonlinear soil-pipeline interaction in both the axial and transverse directions are taken into account. Compared with existing analytical methodologies and 3D nonlinear finite element analysis, the analytical methodology presented is suitable for engineering applications due to exact and conservative results.