Xiaoxue Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiaoxue Zhang has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Tong Heng Lee
Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore
9 shared publications - Zilong Cheng
Department of Electrical and Computer Engineering, National University of Singapore, Singapore
9 shared publications - Jun Ma
Robotics and Autonomous Systems Thrust The Hong Kong University of Science and Technology ( Guangzhou
8 shared publications - Masayoshi Tomizuka
UC Berkeley
4 shared publications - Frank L. Lewis
UTA Research Institute, The University of Texas at Arlington, Arlington, TX, USA
3 shared publications - Sunan Huang
Department of Temasek Laboratories, National University of Singapore, Singapore, Singapore
2 shared publications
Latest Publications
- Top Cited Papers
- 17 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (12) , 23031-23042
Alternating Direction Method of Multipliers for Constrained Iterative LQR in Autonomous Driving
In the context of autonomous driving, the iterative linear quadratic regulator (iLQR) is known to be an efficient approach to deal with the nonlinear vehicle model in motion planning problems. Particularly, the constrained iLQR algorithm has shown noteworthy advantageous outcomes of computation efficiency in achieving motion planning tasks under general constraints of different types. However, the constrained iLQR methodology requires a feasible trajectory at the first iteration as a prerequisite when the logarithmic barrier function is used. Also, the methodology leaves open the possibility for incorporation of fast, efficient, and effective optimization methods (i.e., fast-solvers) to further speed up the optimization process such that the requirements of real-time implementation can be successfully fulfilled. In this paper, a well-defined and commonly-encountered motion planning problem is formulated under nonlinear vehicle dynamics and various constraints, and the alternating direction method of multipliers (ADMM) is utilized to determine the optimal control actions leveraging the iLQR. With this development, the approach is able to circumvent the feasibility requirement of the trajectory at the first iteration. An illustrative example of motion planning for autonomous vehicles is then investigated with different driving scenarios taken into consideration, and a noteworthy achievement of high computation efficiency is attained with the proposed development. Comparing with the constrained iLQR algorithm based on the logarithmic barrier function, our proposed method reduces the average computation time by$31.93\%$ ,$38.52\%$ , and$44.57\%$ in the three scenarios; compared with the optimization solver IPOPT, our proposed method reduces the average computation time by$46.02\%$ ,$53.26\%$ , and$88.43\%$ in the three scenarios. As a result, real-time computation and implementation can be realized through our proposed framework, and thus it provides additional safety to the on-road driving tasks.- 17 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (12) , 23031-23042
Top Cited PapersAlternating Direction Method of Multipliers for Constrained Iterative LQR in Autonomous Driving
In the context of autonomous driving, the iterative linear quadratic regulator (iLQR) is known to be an efficient approach to deal with the nonlinear vehicle model in motion planning problems. Particularly, the constrained iLQR algorithm has shown noteworthy advantageous outcomes of computation efficiency in achieving motion planning tasks under general constraints of different types. However, the constrained iLQR methodology requires a feasible trajectory at the first iteration as a prerequisite when the logarithmic barrier function is used. Also, the methodology leaves open the possibility for incorporation of fast, efficient, and effective optimization methods (i.e., fast-solvers) to further speed up the optimization process such that the requirements of real-time implementation can be successfully fulfilled. In this paper, a well-defined and commonly-encountered motion planning problem is formulated under nonlinear vehicle dynamics and various constraints, and the alternating direction method of multipliers (ADMM) is utilized to determine the optimal control actions leveraging the iLQR. With this development, the approach is able to circumvent the feasibility requirement of the trajectory at the first iteration. An illustrative example of motion planning for autonomous vehicles is then investigated with different driving scenarios taken into consideration, and a noteworthy achievement of high computation efficiency is attained with the proposed development. Comparing with the constrained iLQR algorithm based on the logarithmic barrier function, our proposed method reduces the average computation time by$31.93\%$ ,$38.52\%$ , and$44.57\%$ in the three scenarios; compared with the optimization solver IPOPT, our proposed method reduces the average computation time by$46.02\%$ ,$53.26\%$ , and$88.43\%$ in the three scenarios. As a result, real-time computation and implementation can be realized through our proposed framework, and thus it provides additional safety to the on-road driving tasks. - 28 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 53 (2) , 1015-1026
On Symmetric Gauss–Seidel ADMM Algorithm for H∞ Guaranteed Cost Control With Convex Parameterization
This article involves the innovative development of a symmetric Gauss–Seidel ADMM algorithm to solve the $\mathcal{H}_{\infty}$ guaranteed cost control problem. In the presence of parametric uncertainties, the $\mathcal{H}_{\infty}$ guaranteed cost control problem generally leads to the large-scale optimization. This is due to the exponential growth of the number of the extreme systems involved with respect to the number of parametric uncertainties. In this work, through a variant of the Youla–Kucera parameterization, the stabilizing controllers are parameterized in a convex set; yielding the outcome that the $\mathcal{H}_{\infty}$ guaranteed cost control problem is converted to a convex optimization problem. Based on an appropriate reformulation using the Schur complement, it then renders possible the use of the ADMM algorithm with symmetric Gauss–Seidel backward and forward sweeps. Significantly, this approach alleviates the often-times prohibitively heavy computational burden typical in many $\mathcal H_{\infty}$ optimization problems while exhibiting good convergence guarantees, which is particularly essential for the related large-scale optimization procedures involved. With this approach, the desired robust stability is ensured, and the disturbance attenuation is maintained at the minimum level in the presence of parametric uncertainties. Rather importantly too, with the attained effectiveness, the methodology thus evidently possesses extensive applicability in various important controller synthesis problems, such as decentralized control, sparse control, and output feedback control problems.
- 28 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 53 (2) , 1015-1026
On Symmetric Gauss–Seidel ADMM Algorithm for H∞ Guaranteed Cost Control With Convex Parameterization
This article involves the innovative development of a symmetric Gauss–Seidel ADMM algorithm to solve the $\mathcal{H}_{\infty}$ guaranteed cost control problem. In the presence of parametric uncertainties, the $\mathcal{H}_{\infty}$ guaranteed cost control problem generally leads to the large-scale optimization. This is due to the exponential growth of the number of the extreme systems involved with respect to the number of parametric uncertainties. In this work, through a variant of the Youla–Kucera parameterization, the stabilizing controllers are parameterized in a convex set; yielding the outcome that the $\mathcal{H}_{\infty}$ guaranteed cost control problem is converted to a convex optimization problem. Based on an appropriate reformulation using the Schur complement, it then renders possible the use of the ADMM algorithm with symmetric Gauss–Seidel backward and forward sweeps. Significantly, this approach alleviates the often-times prohibitively heavy computational burden typical in many $\mathcal H_{\infty}$ optimization problems while exhibiting good convergence guarantees, which is particularly essential for the related large-scale optimization procedures involved. With this approach, the desired robust stability is ensured, and the disturbance attenuation is maintained at the minimum level in the presence of parametric uncertainties. Rather importantly too, with the attained effectiveness, the methodology thus evidently possesses extensive applicability in various important controller synthesis problems, such as decentralized control, sparse control, and output feedback control problems.
- Open AccessOn Symmetric Gauss-Seidel ADMM Algorithm for $\mathcal{H}_\infty$ Guaranteed Cost Control with Convex Parameterization
This paper involves the innovative development of a symmetric Gauss-Seidel ADMM algorithm to solve the H-infinity guaranteed cost control problem. In the presence of parametric uncertainties, the H-infinity guaranteed cost control problem generally leads to the large-scale optimization. This is due to the exponential growth of the number of the extreme systems involved with respect to the number of parametric uncertainties. In this work, through a variant of the Youla-Kucera parameterization, the stabilizing controllers are parameterized in a convex set; yielding the outcome that the H-infinity guaranteed cost control problem is converted to a convex optimization problem. Based on an appropriate re-formulation using the Schur complement, it then renders possible the use of the ADMM algorithm with symmetric Gauss-Seidel backward and forward sweeps. Significantly, this approach alleviates the often-times prohibitively heavy computational burden typical in many H-infinity optimization problems while exhibiting good convergence guarantees, which is particularly essential for the related large-scale optimization procedures involved. With this approach, the desired robust stability is ensured, and the disturbance attenuation is maintained at the minimum level in the presence of parametric uncertainties. Rather importantly too, with the attained effectiveness, the methodology thus evidently possesses extensive applicability in various important controller synthesis problems, such as decentralized control, sparse control, and output feedback control problems.
Open AccessOn Symmetric Gauss-Seidel ADMM Algorithm for $\mathcal{H}_\infty$ Guaranteed Cost Control with Convex ParameterizationThis paper involves the innovative development of a symmetric Gauss-Seidel ADMM algorithm to solve the H-infinity guaranteed cost control problem. In the presence of parametric uncertainties, the H-infinity guaranteed cost control problem generally leads to the large-scale optimization. This is due to the exponential growth of the number of the extreme systems involved with respect to the number of parametric uncertainties. In this work, through a variant of the Youla-Kucera parameterization, the stabilizing controllers are parameterized in a convex set; yielding the outcome that the H-infinity guaranteed cost control problem is converted to a convex optimization problem. Based on an appropriate re-formulation using the Schur complement, it then renders possible the use of the ADMM algorithm with symmetric Gauss-Seidel backward and forward sweeps. Significantly, this approach alleviates the often-times prohibitively heavy computational burden typical in many H-infinity optimization problems while exhibiting good convergence guarantees, which is particularly essential for the related large-scale optimization procedures involved. With this approach, the desired robust stability is ensured, and the disturbance attenuation is maintained at the minimum level in the presence of parametric uncertainties. Rather importantly too, with the attained effectiveness, the methodology thus evidently possesses extensive applicability in various important controller synthesis problems, such as decentralized control, sparse control, and output feedback control problems.
- 2 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (9) , 5354-5365
Local Learning Enabled Iterative Linear Quadratic Regulator for Constrained Trajectory Planning
Trajectory planning is one of the indispensable and critical components in robotics and autonomous systems. As an efficient indirect method to deal with the nonlinear system dynamics in trajectory planning tasks over the unconstrained state and control space, the iterative linear quadratic regulator (iLQR) has demonstrated noteworthy outcomes. In this article, a local-learning-enabled constrained iLQR algorithm is herein presented for trajectory planning based on hybrid dynamic optimization and machine learning. Rather importantly, this algorithm attains the key advantage of circumventing the requirement of system identification, and the trajectory planning task is achieved with a simultaneous refinement of the optimal policy and the neural network system in an iterative framework. The neural network can be designed to represent the local system model with a simple architecture, and thus it leads to a sample-efficient training pipeline. In addition, in this learning paradigm, the constraints of the general form that are typically encountered in trajectory planning tasks are preserved. Several illustrative examples on trajectory planning are scheduled as part of the test itinerary to demonstrate the effectiveness and significance of this work.
- 2 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (9) , 5354-5365
Local Learning Enabled Iterative Linear Quadratic Regulator for Constrained Trajectory Planning
Trajectory planning is one of the indispensable and critical components in robotics and autonomous systems. As an efficient indirect method to deal with the nonlinear system dynamics in trajectory planning tasks over the unconstrained state and control space, the iterative linear quadratic regulator (iLQR) has demonstrated noteworthy outcomes. In this article, a local-learning-enabled constrained iLQR algorithm is herein presented for trajectory planning based on hybrid dynamic optimization and machine learning. Rather importantly, this algorithm attains the key advantage of circumventing the requirement of system identification, and the trajectory planning task is achieved with a simultaneous refinement of the optimal policy and the neural network system in an iterative framework. The neural network can be designed to represent the local system model with a simple architecture, and thus it leads to a sample-efficient training pipeline. In addition, in this learning paradigm, the constraints of the general form that are typically encountered in trajectory planning tasks are preserved. Several illustrative examples on trajectory planning are scheduled as part of the test itinerary to demonstrate the effectiveness and significance of this work.
- Retracted
- 8 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. PP (23798858) , 1
Notice of Violation of IEEE Publication Principles: Sequential Convex Programming for Collaboration of Connected and Automated Vehicles
This paper investigates the collaboration of multiple connected and automated vehicles (CAVs) in different scenarios. In general, the collaboration of CAVs can be formulated as a nonlinear and nonconvex MPC problem. Most of the existing approaches available for utilization to solve such an optimization problem suffer from the drawback of considerable computational burden, which hinders the practical implementation in real time. This paper proposes the use of SCP, which is a powerful approach to solving the nonlinear and nonconvex MPC problem in real time. To appropriately deploy the methodology, as a first stage, SCP requires linearization and discretization when addressing the nonlinear dynamics of the system model adequately. Based on the linearization and discretization, the original MPC problem can be transformed into a QCQP problem. Besides, SCP also involves convexification to handle the associated nonconvex constraints. Thus, the nonconvex QCQP can be reduced to a quadratic programming (QP) problem that can be solved rather quickly. Therefore, the computational efficiency is suitably improved despite the existence of nonlinear and nonconvex characteristics, whereby the implementation is realized in real time. Furthermore, simulation results in three different scenarios of autonomous driving are presented to validate the effectiveness and efficiency of our proposed approach.
- 8 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Vehicles
- Vol. PP (23798858) , 1
RetractedNotice of Violation of IEEE Publication Principles: Sequential Convex Programming for Collaboration of Connected and Automated Vehicles
This paper investigates the collaboration of multiple connected and automated vehicles (CAVs) in different scenarios. In general, the collaboration of CAVs can be formulated as a nonlinear and nonconvex MPC problem. Most of the existing approaches available for utilization to solve such an optimization problem suffer from the drawback of considerable computational burden, which hinders the practical implementation in real time. This paper proposes the use of SCP, which is a powerful approach to solving the nonlinear and nonconvex MPC problem in real time. To appropriately deploy the methodology, as a first stage, SCP requires linearization and discretization when addressing the nonlinear dynamics of the system model adequately. Based on the linearization and discretization, the original MPC problem can be transformed into a QCQP problem. Besides, SCP also involves convexification to handle the associated nonconvex constraints. Thus, the nonconvex QCQP can be reduced to a quadratic programming (QP) problem that can be solved rather quickly. Therefore, the computational efficiency is suitably improved despite the existence of nonlinear and nonconvex characteristics, whereby the implementation is realized in real time. Furthermore, simulation results in three different scenarios of autonomous driving are presented to validate the effectiveness and efficiency of our proposed approach.
- 20 August 2021
- Published by Springer Nature in Journal of Sustainable Metallurgy
- Vol. 7 (3) , 1343-1353
Comprehensive Recovery of Aluminum and Calcium from Aluminum-Anodizing Sludge by Physicochemical Process
- 20 August 2021
- Published by Springer Nature in Journal of Sustainable Metallurgy
- Vol. 7 (3) , 1343-1353
Comprehensive Recovery of Aluminum and Calcium from Aluminum-Anodizing Sludge by Physicochemical Process
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (7) , 9240-9251
Semi-Definite Relaxation-Based ADMM for Cooperative Planning and Control of Connected Autonomous Vehicles
This paper investigates the cooperative planning and control problem for multiple connected autonomous vehicles (CAVs) in different scenarios. In the existing literature, most of the methods suffer from significant problems in computational efficiency. Furthermore, as the optimization problem is nonlinear and nonconvex, it typically poses great difficulty in determining the optimal solution. To address this issue, this work proposes a novel and completely parallel computation framework by leveraging the alternating direction method of multipliers (ADMM). The nonlinear and nonconvex optimization problem in the autonomous driving problem can be divided into two manageable sub-problems; and the resulting sub-problems can be solved by using effective optimization methods in a parallel framework. Here, the differential dynamic programming (DDP) algorithm is capable of addressing the nonlinearity of the system dynamics rather effectively; and the nonconvex coupling constraints with small dimensions can be resolved by invoking the notion of semi-definite relaxation (SDR), which can also be solved in a very short time. Due to the parallel computation and efficient relaxation of nonconvex constraints, our proposed approach effectively realizes real-time implementation; and thus extra assurance of driving safety is provided. In addition, two transportation scenarios for multiple CAVs are used to illustrate the effectiveness and efficiency of the proposed method.
- 14 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 23 (7) , 9240-9251
Semi-Definite Relaxation-Based ADMM for Cooperative Planning and Control of Connected Autonomous Vehicles
This paper investigates the cooperative planning and control problem for multiple connected autonomous vehicles (CAVs) in different scenarios. In the existing literature, most of the methods suffer from significant problems in computational efficiency. Furthermore, as the optimization problem is nonlinear and nonconvex, it typically poses great difficulty in determining the optimal solution. To address this issue, this work proposes a novel and completely parallel computation framework by leveraging the alternating direction method of multipliers (ADMM). The nonlinear and nonconvex optimization problem in the autonomous driving problem can be divided into two manageable sub-problems; and the resulting sub-problems can be solved by using effective optimization methods in a parallel framework. Here, the differential dynamic programming (DDP) algorithm is capable of addressing the nonlinearity of the system dynamics rather effectively; and the nonconvex coupling constraints with small dimensions can be resolved by invoking the notion of semi-definite relaxation (SDR), which can also be solved in a very short time. Due to the parallel computation and efficient relaxation of nonconvex constraints, our proposed approach effectively realizes real-time implementation; and thus extra assurance of driving safety is provided. In addition, two transportation scenarios for multiple CAVs are used to illustrate the effectiveness and efficiency of the proposed method.
- 19 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (11) , 5554-5560
Optimal Decentralized Control for Uncertain Systems by Symmetric Gauss–Seidel Semi-Proximal ALM
The $\mathcal {H}_2$ -guaranteed cost decentralized control problem is investigated in this article. More specifically, on the basis of an appropriate $\mathcal {H}_2$ reformulation that we put in place, the optimal control problem in the presence of parameter uncertainties is then suitably characterized by convex restriction and solved in parameter space. It is shown that a set of stabilizing decentralized controller gains for the uncertain system is parameterized in a convex set through appropriate convex restriction, and then an approximated conic optimization problem is constructed. This facilitates the use of the symmetric Gauss–Seidel (sGS) semi-proximal augmented Lagrangian method (ALM), which attains high computational effectiveness. A comprehensive analysis is given on the application of the approach in solving the optimal decentralized control problem; and subsequently, the preserved decentralized structure, robust stability, and robust performance are all suitably guaranteed with the proposed methodology. Furthermore, an illustrative example is presented to demonstrate the effectiveness of the proposed optimization approach.
- 19 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (11) , 5554-5560
Optimal Decentralized Control for Uncertain Systems by Symmetric Gauss–Seidel Semi-Proximal ALM
The $\mathcal {H}_2$ -guaranteed cost decentralized control problem is investigated in this article. More specifically, on the basis of an appropriate $\mathcal {H}_2$ reformulation that we put in place, the optimal control problem in the presence of parameter uncertainties is then suitably characterized by convex restriction and solved in parameter space. It is shown that a set of stabilizing decentralized controller gains for the uncertain system is parameterized in a convex set through appropriate convex restriction, and then an approximated conic optimization problem is constructed. This facilitates the use of the symmetric Gauss–Seidel (sGS) semi-proximal augmented Lagrangian method (ALM), which attains high computational effectiveness. A comprehensive analysis is given on the application of the approach in solving the optimal decentralized control problem; and subsequently, the preserved decentralized structure, robust stability, and robust performance are all suitably guaranteed with the proposed methodology. Furthermore, an illustrative example is presented to demonstrate the effectiveness of the proposed optimization approach.
- 24 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 51 (7) , 3616-3629
Trajectory Generation by Chance-Constrained Nonlinear MPC With Probabilistic Prediction
Continued great efforts have been dedicated toward high-quality trajectory generation based on optimization methods; however, most of them do not suitably and effectively consider the situation with moving obstacles; and more particularly, the future position of these moving obstacles in the presence of uncertainty within some possible prescribed prediction horizon. To cater to this rather major shortcoming, this work shows how a variational Bayesian Gaussian mixture model (vBGMM) framework can be employed to predict the future trajectory of moving obstacles; and then with this methodology, a trajectory generation framework is proposed which will efficiently and effectively address trajectory generation in the presence of moving obstacles, and incorporate the presence of uncertainty within a prediction horizon. In this work, the full predictive conditional probability density function (PDF) with mean and covariance is obtained and, thus, a future trajectory with uncertainty is formulated as a collision region represented by a confidence ellipsoid. To avoid the collision region, chance constraints are imposed to restrict the collision probability, and subsequently, a nonlinear model predictive control problem is constructed with these chance constraints. It is shown that the proposed approach is able to predict the future position of the moving obstacles effectively; and, thus, based on the environmental information of the probabilistic prediction, it is also shown that the timing of collision avoidance can be earlier than the method without prediction. The tracking error and distance to obstacles of the trajectory with prediction are smaller compared with the method without prediction.
- 24 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 51 (7) , 3616-3629
Trajectory Generation by Chance-Constrained Nonlinear MPC With Probabilistic Prediction
Continued great efforts have been dedicated toward high-quality trajectory generation based on optimization methods; however, most of them do not suitably and effectively consider the situation with moving obstacles; and more particularly, the future position of these moving obstacles in the presence of uncertainty within some possible prescribed prediction horizon. To cater to this rather major shortcoming, this work shows how a variational Bayesian Gaussian mixture model (vBGMM) framework can be employed to predict the future trajectory of moving obstacles; and then with this methodology, a trajectory generation framework is proposed which will efficiently and effectively address trajectory generation in the presence of moving obstacles, and incorporate the presence of uncertainty within a prediction horizon. In this work, the full predictive conditional probability density function (PDF) with mean and covariance is obtained and, thus, a future trajectory with uncertainty is formulated as a collision region represented by a confidence ellipsoid. To avoid the collision region, chance constraints are imposed to restrict the collision probability, and subsequently, a nonlinear model predictive control problem is constructed with these chance constraints. It is shown that the proposed approach is able to predict the future position of the moving obstacles effectively; and, thus, based on the environmental information of the probabilistic prediction, it is also shown that the timing of collision avoidance can be earlier than the method without prediction. The tracking error and distance to obstacles of the trajectory with prediction are smaller compared with the method without prediction.
- 31 January 2020
- Published by SPIE-Intl Soc Optical Eng
- Vol. 11427, 95
Aerosol particle measurement system based on off-axis digital holography
Atmospheric aerosol refers to the stable mixing system composed of solid and liquid particles evenly dispersed in the atmosphere, and the particles are collectively referred to as aerosol particles. Aerosol particle detection is an important aspect of environmental monitoring. With the development of computer technology and holographic technology, the resolution of holographic measurement technology continues to improve. At present, digital holography can be used to measure the tiny displacement, deformation and vibration of opaque objects. In this paper, aluminum oxide powder is used to simulate aerosol particles. Aerosol particles are recorded by digital holography and holograms of aerosol particles are obtained. Finally, the shape and size of aerosol particles can be obtained.
- 31 January 2020
- Published by SPIE-Intl Soc Optical Eng
- Vol. 11427, 95
Aerosol particle measurement system based on off-axis digital holography
Atmospheric aerosol refers to the stable mixing system composed of solid and liquid particles evenly dispersed in the atmosphere, and the particles are collectively referred to as aerosol particles. Aerosol particle detection is an important aspect of environmental monitoring. With the development of computer technology and holographic technology, the resolution of holographic measurement technology continues to improve. At present, digital holography can be used to measure the tiny displacement, deformation and vibration of opaque objects. In this paper, aluminum oxide powder is used to simulate aerosol particles. Aerosol particles are recorded by digital holography and holograms of aerosol particles are obtained. Finally, the shape and size of aerosol particles can be obtained.