Author: Yu Feng
Publisher: Springer
ISBN: 9811036772
Category : Technology & Engineering
Languages : en
Pages : 148
Book Description
This book develops original results regarding singular dynamic systems following two different paths. The first consists of generalizing results from classical state-space cases to linear descriptor systems, such as dilated linear matrix inequality (LMI) characterizations for descriptor systems and performance control under regulation constraints. The second is a new path, which considers descriptor systems as a powerful tool for conceiving new control laws, understanding and deciphering some controller’s architecture and even homogenizing different—existing—ways of obtaining some new and/or known results for state-space systems. The book also highlights the comprehensive control problem for descriptor systems as an example of using the descriptor framework in order to transform a non-standard control problem into a classic stabilization control problem. In another section, an accurate solution is derived for the sensitivity constrained linear optimal control also using the descriptor framework. The book is intended for graduate and postgraduate students, as well as researchers in the field of systems and control theory.
Robust Control of Linear Descriptor Systems
Author: Yu Feng
Publisher: Springer
ISBN: 9811036772
Category : Technology & Engineering
Languages : en
Pages : 148
Book Description
This book develops original results regarding singular dynamic systems following two different paths. The first consists of generalizing results from classical state-space cases to linear descriptor systems, such as dilated linear matrix inequality (LMI) characterizations for descriptor systems and performance control under regulation constraints. The second is a new path, which considers descriptor systems as a powerful tool for conceiving new control laws, understanding and deciphering some controller’s architecture and even homogenizing different—existing—ways of obtaining some new and/or known results for state-space systems. The book also highlights the comprehensive control problem for descriptor systems as an example of using the descriptor framework in order to transform a non-standard control problem into a classic stabilization control problem. In another section, an accurate solution is derived for the sensitivity constrained linear optimal control also using the descriptor framework. The book is intended for graduate and postgraduate students, as well as researchers in the field of systems and control theory.
Publisher: Springer
ISBN: 9811036772
Category : Technology & Engineering
Languages : en
Pages : 148
Book Description
This book develops original results regarding singular dynamic systems following two different paths. The first consists of generalizing results from classical state-space cases to linear descriptor systems, such as dilated linear matrix inequality (LMI) characterizations for descriptor systems and performance control under regulation constraints. The second is a new path, which considers descriptor systems as a powerful tool for conceiving new control laws, understanding and deciphering some controller’s architecture and even homogenizing different—existing—ways of obtaining some new and/or known results for state-space systems. The book also highlights the comprehensive control problem for descriptor systems as an example of using the descriptor framework in order to transform a non-standard control problem into a classic stabilization control problem. In another section, an accurate solution is derived for the sensitivity constrained linear optimal control also using the descriptor framework. The book is intended for graduate and postgraduate students, as well as researchers in the field of systems and control theory.
Some results on closed-loop identification of quadcopters
Author: Du Ho
Publisher: Linköping University Electronic Press
ISBN: 9176851664
Category :
Languages : en
Pages : 116
Book Description
In recent years, the quadcopter has become a popular platform both in research activities and in industrial development. Its success is due to its increased performance and capabilities, where modeling and control synthesis play essential roles. These techniques have been used for stabilizing the quadcopter in different flight conditions such as hovering and climbing. The performance of the control system depends on parameters of the quadcopter which are often unknown and need to be estimated. The common approach to determine such parameters is to rely on accurate measurements from external sources, i.e., a motion capture system. In this work, only measurements from low-cost onboard sensors are used. This approach and the fact that the measurements are collected in closed-loop present additional challenges. First, a general overview of the quadcopter is given and a detailed dynamic model is presented, taking into account intricate aerodynamic phenomena. By projecting this model onto the vertical axis, a nonlinear vertical submodel of the quadcopter is obtained. The Instrumental Variable (IV) method is used to estimate the parameters of the submodel using real data. The result shows that adding an extra term in the thrust equation is essential. In a second contribution, a sensor-to-sensor estimation problem is studied, where only measurements from an onboard Inertial Measurement Unit (IMU) are used. The roll submodel is derived by linearizing the general model of the quadcopter along its main frame. A comparison is carried out based on simulated and experimental data. It shows that the IV method provides accurate estimates of the parameters of the roll submodel whereas some other common approaches are not able to do this. In a sensor-to-sensor modeling approach, it is sometimes not obvious which signals to select as input and output. In this case, several common methods give different results when estimating the forward and inverse models. However, it is shown that the IV method will give identical results when estimating the forward and inverse models of a single-input single-output (SISO) system using finite data. Furthermore, this result is illustrated experimentally when the goal is to determine the center of gravity of a quadcopter.
Publisher: Linköping University Electronic Press
ISBN: 9176851664
Category :
Languages : en
Pages : 116
Book Description
In recent years, the quadcopter has become a popular platform both in research activities and in industrial development. Its success is due to its increased performance and capabilities, where modeling and control synthesis play essential roles. These techniques have been used for stabilizing the quadcopter in different flight conditions such as hovering and climbing. The performance of the control system depends on parameters of the quadcopter which are often unknown and need to be estimated. The common approach to determine such parameters is to rely on accurate measurements from external sources, i.e., a motion capture system. In this work, only measurements from low-cost onboard sensors are used. This approach and the fact that the measurements are collected in closed-loop present additional challenges. First, a general overview of the quadcopter is given and a detailed dynamic model is presented, taking into account intricate aerodynamic phenomena. By projecting this model onto the vertical axis, a nonlinear vertical submodel of the quadcopter is obtained. The Instrumental Variable (IV) method is used to estimate the parameters of the submodel using real data. The result shows that adding an extra term in the thrust equation is essential. In a second contribution, a sensor-to-sensor estimation problem is studied, where only measurements from an onboard Inertial Measurement Unit (IMU) are used. The roll submodel is derived by linearizing the general model of the quadcopter along its main frame. A comparison is carried out based on simulated and experimental data. It shows that the IV method provides accurate estimates of the parameters of the roll submodel whereas some other common approaches are not able to do this. In a sensor-to-sensor modeling approach, it is sometimes not obvious which signals to select as input and output. In this case, several common methods give different results when estimating the forward and inverse models. However, it is shown that the IV method will give identical results when estimating the forward and inverse models of a single-input single-output (SISO) system using finite data. Furthermore, this result is illustrated experimentally when the goal is to determine the center of gravity of a quadcopter.
On Motion Planning Using Numerical Optimal Control
Author: Kristoffer Bergman
Publisher: Linköping University Electronic Press
ISBN: 9176850579
Category :
Languages : en
Pages : 112
Book Description
During the last decades, motion planning for autonomous systems has become an important area of research. The high interest is not the least due to the development of systems such as self-driving cars, unmanned aerial vehicles and robotic manipulators. In this thesis, the objective is not only to find feasible solutions to a motion planning problem, but solutions that also optimize some kind of performance measure. From a control perspective, the resulting problem is an instance of an optimal control problem. In this thesis, the focus is to further develop optimal control algorithms such that they be can used to obtain improved solutions to motion planning problems. This is achieved by combining ideas from automatic control, numerical optimization and robotics. First, a systematic approach for computing local solutions to motion planning problems in challenging environments is presented. The solutions are computed by combining homotopy methods and numerical optimal control techniques. The general principle is to define a homotopy that transforms, or preferably relaxes, the original problem to an easily solved problem. The approach is demonstrated in motion planning problems in 2D and 3D environments, where the presented method outperforms both a state-of-the-art numerical optimal control method based on standard initialization strategies and a state-of-the-art optimizing sampling-based planner based on random sampling. Second, a framework for automatically generating motion primitives for lattice-based motion planners is proposed. Given a family of systems, the user only needs to specify which principle types of motions that are relevant for the considered system family. Based on the selected principle motions and a selected system instance, the algorithm not only automatically optimizes the motions connecting pre-defined boundary conditions, but also simultaneously optimizes the terminal state constraints as well. In addition to handling static a priori known system parameters such as platform dimensions, the framework also allows for fast automatic re-optimization of motion primitives if the system parameters change while the system is in use. Furthermore, the proposed framework is extended to also allow for an optimization of discretization parameters, that are are used by the lattice-based motion planner to define a state-space discretization. This enables an optimized selection of these parameters for a specific system instance. Finally, a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems is presented. The main idea is to combine the strengths of sampling-based path planners and numerical optimal control. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with those used in a second numerical optimal control step. This novel tight combination of a sampling-based path planner and numerical optimal control makes, in a structured way, benefit of the former method’s ability to solve combinatorial parts of the problem and the latter method’s ability to obtain locally optimal solutions not constrained to a discretized search space. The proposed approach is shown in several practically relevant path planning problems to provide improvements in terms of computation time, numerical reliability, and objective function value.
Publisher: Linköping University Electronic Press
ISBN: 9176850579
Category :
Languages : en
Pages : 112
Book Description
During the last decades, motion planning for autonomous systems has become an important area of research. The high interest is not the least due to the development of systems such as self-driving cars, unmanned aerial vehicles and robotic manipulators. In this thesis, the objective is not only to find feasible solutions to a motion planning problem, but solutions that also optimize some kind of performance measure. From a control perspective, the resulting problem is an instance of an optimal control problem. In this thesis, the focus is to further develop optimal control algorithms such that they be can used to obtain improved solutions to motion planning problems. This is achieved by combining ideas from automatic control, numerical optimization and robotics. First, a systematic approach for computing local solutions to motion planning problems in challenging environments is presented. The solutions are computed by combining homotopy methods and numerical optimal control techniques. The general principle is to define a homotopy that transforms, or preferably relaxes, the original problem to an easily solved problem. The approach is demonstrated in motion planning problems in 2D and 3D environments, where the presented method outperforms both a state-of-the-art numerical optimal control method based on standard initialization strategies and a state-of-the-art optimizing sampling-based planner based on random sampling. Second, a framework for automatically generating motion primitives for lattice-based motion planners is proposed. Given a family of systems, the user only needs to specify which principle types of motions that are relevant for the considered system family. Based on the selected principle motions and a selected system instance, the algorithm not only automatically optimizes the motions connecting pre-defined boundary conditions, but also simultaneously optimizes the terminal state constraints as well. In addition to handling static a priori known system parameters such as platform dimensions, the framework also allows for fast automatic re-optimization of motion primitives if the system parameters change while the system is in use. Furthermore, the proposed framework is extended to also allow for an optimization of discretization parameters, that are are used by the lattice-based motion planner to define a state-space discretization. This enables an optimized selection of these parameters for a specific system instance. Finally, a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems is presented. The main idea is to combine the strengths of sampling-based path planners and numerical optimal control. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with those used in a second numerical optimal control step. This novel tight combination of a sampling-based path planner and numerical optimal control makes, in a structured way, benefit of the former method’s ability to solve combinatorial parts of the problem and the latter method’s ability to obtain locally optimal solutions not constrained to a discretized search space. The proposed approach is shown in several practically relevant path planning problems to provide improvements in terms of computation time, numerical reliability, and objective function value.
Control, Models and Industrial Manipulators
Author: Erik Hedberg
Publisher: Linköping University Electronic Press
ISBN: 9179297404
Category :
Languages : en
Pages : 64
Book Description
The two topics at the heart of this thesis are how to improve control of industrial manipulators and how to reason about the role of models in automatic control. On industrial manipulators, two case studies are presented. The first investigates estimation with inertial sensors, and the second compares control by feedback linearization to control based on gain-scheduling. The contributions on the second topic illustrate the close connection between control and estimation in different ways. A conceptual model of control is introduced, which can be used to emphasize the role of models as well as the human aspect of control engineering. Some observations are made regarding block-diagram reformulations that illustrate the relation between models, control and inversion. Finally, a suggestion for how the internal model principle, internal model control, disturbance observers and Youla-Kucera parametrization can be introduced in a unified way is presented.
Publisher: Linköping University Electronic Press
ISBN: 9179297404
Category :
Languages : en
Pages : 64
Book Description
The two topics at the heart of this thesis are how to improve control of industrial manipulators and how to reason about the role of models in automatic control. On industrial manipulators, two case studies are presented. The first investigates estimation with inertial sensors, and the second compares control by feedback linearization to control based on gain-scheduling. The contributions on the second topic illustrate the close connection between control and estimation in different ways. A conceptual model of control is introduced, which can be used to emphasize the role of models as well as the human aspect of control engineering. Some observations are made regarding block-diagram reformulations that illustrate the relation between models, control and inversion. Finally, a suggestion for how the internal model principle, internal model control, disturbance observers and Youla-Kucera parametrization can be introduced in a unified way is presented.
Analysis and Design of Descriptor Linear Systems
Author: Guang-Ren Duan
Publisher: Springer Science & Business Media
ISBN: 1441963979
Category : Mathematics
Languages : en
Pages : 504
Book Description
Descriptor linear systems theory is an important part in the general field of control systems theory, and has attracted much attention in the last two decades. In spite of the fact that descriptor linear systems theory has been a topic very rich in content, there have been only a few books on this topic. This book provides a systematic introduction to the theory of continuous-time descriptor linear systems and aims to provide a relatively systematic introduction to the basic results in descriptor linear systems theory. The clear representation of materials and a large number of examples make this book easy to understand by a large audience. General readers will find in this book a comprehensive introduction to the theory of descriptive linear systems. Researchers will find a comprehensive description of the most recent results in this theory and students will find a good introduction to some important problems in linear systems theory.
Publisher: Springer Science & Business Media
ISBN: 1441963979
Category : Mathematics
Languages : en
Pages : 504
Book Description
Descriptor linear systems theory is an important part in the general field of control systems theory, and has attracted much attention in the last two decades. In spite of the fact that descriptor linear systems theory has been a topic very rich in content, there have been only a few books on this topic. This book provides a systematic introduction to the theory of continuous-time descriptor linear systems and aims to provide a relatively systematic introduction to the basic results in descriptor linear systems theory. The clear representation of materials and a large number of examples make this book easy to understand by a large audience. General readers will find in this book a comprehensive introduction to the theory of descriptive linear systems. Researchers will find a comprehensive description of the most recent results in this theory and students will find a good introduction to some important problems in linear systems theory.
On Informative Path Planning for Tracking and Surveillance
Author: Per Boström-Rost
Publisher: Linköping University Electronic Press
ISBN: 9176850757
Category :
Languages : en
Pages : 106
Book Description
This thesis studies a class of sensor management problems called informative path planning (IPP). Sensor management refers to the problem of optimizing control inputs for sensor systems in dynamic environments in order to achieve operational objectives. The problems are commonly formulated as stochastic optimal control problems, where to objective is to maximize the information gained from future measurements. In IPP, the control inputs affect the movement of the sensor platforms, and the goal is to compute trajectories from where the sensors can obtain measurements that maximize the estimation performance. The core challenge lies in making decisions based on the predicted utility of future measurements. In linear Gaussian settings, the estimation performance is independent of the actual measurements. This means that IPP becomes a deterministic optimal control problem, for which standard numerical optimization techniques can be applied. This is exploited in the first part of this thesis. A surveillance application is considered, where a mobile sensor is gathering information about features of interest while avoiding being tracked by an adversarial observer. The problem is formulated as an optimization problem that allows for a trade-off between informativeness and stealth. We formulate a theorem that makes it possible to reformulate a class of nonconvex optimization problems with matrix-valued variables as convex optimization problems. This theorem is then used to prove that the seemingly intractable IPP problem can be solved to global optimality using off-the-shelf optimization tools. The second part of this thesis considers tracking of a maneuvering target using a mobile sensor with limited field of view. The problem is formulated as an IPP problem, where the goal is to generate a sensor trajectory that maximizes the expected tracking performance, captured by a measure of the covariance matrix of the target state estimate. When the measurements are nonlinear functions of the target state, the tracking performance depends on the actual measurements, which depend on the target’s trajectory. Since these are unavailable in the planning stage, the problem becomes a stochastic optimal control problem. An approximation of the problem based on deterministic sampling of the distribution of the predicted target trajectory is proposed. It is demonstrated in a simulation study that the proposed method significantly increases the tracking performance compared to a conventional approach that neglects the uncertainty in the future target trajectory.
Publisher: Linköping University Electronic Press
ISBN: 9176850757
Category :
Languages : en
Pages : 106
Book Description
This thesis studies a class of sensor management problems called informative path planning (IPP). Sensor management refers to the problem of optimizing control inputs for sensor systems in dynamic environments in order to achieve operational objectives. The problems are commonly formulated as stochastic optimal control problems, where to objective is to maximize the information gained from future measurements. In IPP, the control inputs affect the movement of the sensor platforms, and the goal is to compute trajectories from where the sensors can obtain measurements that maximize the estimation performance. The core challenge lies in making decisions based on the predicted utility of future measurements. In linear Gaussian settings, the estimation performance is independent of the actual measurements. This means that IPP becomes a deterministic optimal control problem, for which standard numerical optimization techniques can be applied. This is exploited in the first part of this thesis. A surveillance application is considered, where a mobile sensor is gathering information about features of interest while avoiding being tracked by an adversarial observer. The problem is formulated as an optimization problem that allows for a trade-off between informativeness and stealth. We formulate a theorem that makes it possible to reformulate a class of nonconvex optimization problems with matrix-valued variables as convex optimization problems. This theorem is then used to prove that the seemingly intractable IPP problem can be solved to global optimality using off-the-shelf optimization tools. The second part of this thesis considers tracking of a maneuvering target using a mobile sensor with limited field of view. The problem is formulated as an IPP problem, where the goal is to generate a sensor trajectory that maximizes the expected tracking performance, captured by a measure of the covariance matrix of the target state estimate. When the measurements are nonlinear functions of the target state, the tracking performance depends on the actual measurements, which depend on the target’s trajectory. Since these are unavailable in the planning stage, the problem becomes a stochastic optimal control problem. An approximation of the problem based on deterministic sampling of the distribution of the predicted target trajectory is proposed. It is demonstrated in a simulation study that the proposed method significantly increases the tracking performance compared to a conventional approach that neglects the uncertainty in the future target trajectory.
On Complexity Certification of Active-Set QP Methods with Applications to Linear MPC
Author: Daniel Arnström
Publisher: Linköping University Electronic Press
ISBN: 9179296920
Category :
Languages : en
Pages : 45
Book Description
In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bounds on worst-case solution time. Often for linear MPC problems, the optimization problem in question is a quadratic program (QP) that depends on parameters such as system states and reference signals. A popular class of methods for solving such QPs is active-set methods, where a sequence of linear systems of equations is solved. The primary contribution of this thesis is a method which determines which sequence of subproblems a popular class of such active-set algorithms need to solve, for every possible QP instance that might arise from a given linear MPC problem (i.e, for every possible state and reference signal). By knowing these sequences, worst-case bounds on how many iterations, floating-point operations and, ultimately, the maximum solution time, these active-set algorithms require to compute a solution can be determined, which is of importance when, e.g, linear MPC is used in safety-critical applications. After establishing this complexity certification method, its applicability is extended by showing how it can be used indirectly to certify the complexity of another, efficient, type of active-set QP algorithm which reformulates the QP as a nonnegative least-squares method. Finally, the proposed complexity certification method is extended further to situations when enhancements to the active-set algorithms are used, namely, when they are terminated early (to save computations) and when outer proximal-point iterations are performed (to improve numerical stability).
Publisher: Linköping University Electronic Press
ISBN: 9179296920
Category :
Languages : en
Pages : 45
Book Description
In model predictive control (MPC) an optimization problem has to be solved at each time step, which in real-time applications makes it important to solve these efficiently and to have good upper bounds on worst-case solution time. Often for linear MPC problems, the optimization problem in question is a quadratic program (QP) that depends on parameters such as system states and reference signals. A popular class of methods for solving such QPs is active-set methods, where a sequence of linear systems of equations is solved. The primary contribution of this thesis is a method which determines which sequence of subproblems a popular class of such active-set algorithms need to solve, for every possible QP instance that might arise from a given linear MPC problem (i.e, for every possible state and reference signal). By knowing these sequences, worst-case bounds on how many iterations, floating-point operations and, ultimately, the maximum solution time, these active-set algorithms require to compute a solution can be determined, which is of importance when, e.g, linear MPC is used in safety-critical applications. After establishing this complexity certification method, its applicability is extended by showing how it can be used indirectly to certify the complexity of another, efficient, type of active-set QP algorithm which reformulates the QP as a nonnegative least-squares method. Finally, the proposed complexity certification method is extended further to situations when enhancements to the active-set algorithms are used, namely, when they are terminated early (to save computations) and when outer proximal-point iterations are performed (to improve numerical stability).
H-infinity Control for Nonlinear Descriptor Systems
Author: He-Sheng Wang
Publisher: Springer Science & Business Media
ISBN: 9781846282898
Category : Technology & Engineering
Languages : en
Pages : 182
Book Description
The authors present a study of the H-infinity control problem and related topics for descriptor systems, described by a set of nonlinear differential-algebraic equations. They derive necessary and sufficient conditions for the existence of a controller solving the standard nonlinear H-infinity control problem considering both state and output feedback. One such condition for the output feedback control problem to be solvable is obtained in terms of Hamilton–Jacobi inequalities and a weak coupling condition; a parameterization of output feedback controllers solving the problem is also provided. All of these results are then specialized to the linear case. The derivation of state-space formulae for all controllers solving the standard H-infinity control problem for descriptor systems is proposed. Among other important topics covered are balanced realization, reduced-order controller design and mixed H2/H-infinity control. "H-infinity Control for Nonlinear Descriptor Systems" provides a comprehensive introduction and easy access to advanced topics.
Publisher: Springer Science & Business Media
ISBN: 9781846282898
Category : Technology & Engineering
Languages : en
Pages : 182
Book Description
The authors present a study of the H-infinity control problem and related topics for descriptor systems, described by a set of nonlinear differential-algebraic equations. They derive necessary and sufficient conditions for the existence of a controller solving the standard nonlinear H-infinity control problem considering both state and output feedback. One such condition for the output feedback control problem to be solvable is obtained in terms of Hamilton–Jacobi inequalities and a weak coupling condition; a parameterization of output feedback controllers solving the problem is also provided. All of these results are then specialized to the linear case. The derivation of state-space formulae for all controllers solving the standard H-infinity control problem for descriptor systems is proposed. Among other important topics covered are balanced realization, reduced-order controller design and mixed H2/H-infinity control. "H-infinity Control for Nonlinear Descriptor Systems" provides a comprehensive introduction and easy access to advanced topics.
Direction of Arrival Estimation for Wildlife Protection
Author: Gustav Zetterqvist
Publisher: Linköping University Electronic Press
ISBN: 9180758304
Category :
Languages : en
Pages : 93
Book Description
Direction of arrival (DOA) estimation is a well-established problem in signal processing. It involves determining the direction from which a signal reaches a sensor array, and is fundamental in applications like radar, sonar, and acoustics. Traditionally, DOA estimation relies on comparing the time of arrival of the signal across different sensors in the array. However, this approach is sensitive to the time difference of arrival (TDOA) between sensors, which can be challenging to estimate accurately. Additionally, precise synchronization among the sensors is essential, but this can be difficult to achieve in certain environments or applications. In this thesis, we explore a novel approach to DOA estimation based on the received signal power at the sensors. The method exploits the directional sensitivity of the microphones in the array, which defines how effectively each microphone captures sound from different directions. To model the directional sensitivity, we use a Fourier series (FS) model. The model is then used to estimate the DOA of a sound source across various environments, and for different types of signals. The parametric model enables Cramér-Rao lower bound (CRLB) analysis of the DOA estimation problem. Our findings demonstrate that the directional sensitivity exhibits a significant variation in accordance with the frequency content of the signal, and we exploit this to estimate the DOA for different types of sounds. The proposed method has been validated with a range of signals, including gunshots, elephant trumpets, sirens, and female screams. The results show that the developed method achieves high accuracy in estimating the DOA for the above-mentioned signals. Furthermore, the method performs similarly well in outdoor scenarios with realistic background noise levels. When compared to state-of-the-art DOA estimation techniques, our approach performs better or equally well for the investigated sounds. A key advantage of this method is that it does not require any TDOA measurement between the microphones, enabling the design of smaller, more compact devices. This opens up new possibilities for estimating DOA in environments where traditional methods are impractical. A limitation, however, is that the method requires knowledge of the microphone’s directional sensitivity, which necessitates calibration in an anechoic chamber. Nevertheless, this calibration has proven to be robust, and only needs to be performed once to create a model applicable across different environments. Additionally, this thesis explores a different application of DOA estimation, where geophones are used to estimate the DOA to elephants. As elephants move, they generate ground vibrations, and these signals can be captured by geophones. We show that a traditional delay-and-sum beamformer can accurately estimate the DOA of elephants at distances up to 40 meters. By determining when elephants are approaching and from which direction, park rangers can take early measures to avoid conflicts between humans and elephants, which is a major problem in some parts of the world. Förmågan att höra var ett ljud kommer ifrån, något vi ofta tar för givet, kallas för riktningsuppfattning. Den gör det möjligt för oss att snabbt avgöra om någon ropar på oss och från vilket håll ljudet kommer. Denna förmåga är viktig för att kunna orientera sig i omgivningen och uppfatta hot eller andra viktiga ljud. Våra öron samarbetar genom att jämföra hur ljud når varje öra, både när det gäller ljudets intensitet och hur lång tid det tar för ljudet att nå dem. Det här kallas för interaural tids- och nivåskillnad. Vissa ljud kan dock vara svåra att uppfatta, till exempel om ljudet är kort och impulsivt, eller om det är i en stadsmiljö med mycket bakgrundsljud och reflektioner. I den här avhandlingen undersöker vi nya metoder för att uppskatta ljudets riktning. Vi använder mikrofoner för att mäta ljudet och beräknar därefter riktningen som ljudet kommer ifrån. Traditionella metoder fokuserar på tidsskillnaden mellan ljud som registreras i olika mikrofoner. Vi tar istället en annan väg och undersöker hur ljudets styrka kan användas för att avgöra riktningen, oavsett tidsskillnader mellan mikrofonerna. Vår metod bygger på att vi skapar en modell av mikrofonernas riktningskänslighet, det vill säga hur väl de uppfattar ljud från olika håll. Modellen skapas genom att mäta mikrofonens riktningskänslighet i ett ekofritt rum. Genom att först mäta detta i en kontrollerad miljö, utan ekon, kan vi sedan använda modellen för att beräkna ljudriktningen i mer varierande miljöer och för olika typer av ljud. Till exempel har vi använt ljud såsom pistolskott, elefanttrumpeter, sirener och skrik för att testa vår metod. Resultaten visar att vår metod kan beräkna riktningar med hög noggrannhet för de ovan nämnda ljuden, även i en utomhusmiljö med mer realistiska nivåer av bakgrundsljud. När vi jämfört vår metod med traditionella metoder, presterar vår lösning lika bra eller bättre för de testade ljuden. En stor fördel med vår metod är att den inte kräver att mikrofonerna är placerade på ett visst avstånd från varandra, vilket innebär att vi kan bygga mindre och mer kompakta enheter. Detta kan leda till nya typer av produkter för att identifiera ljudriktningar i olika situationer. En nackdel är dock att mikrofonernas riktningskänslighet måste kalibreras i ett ljudlabb, men denna kalibrering har visat sig vara robust och det räcker att utföra en kalibrering som kan användas i flera olika miljöer. I avhandlingen inkluderas även en annan tillämpning av riktningsskattning, nämligen att uppskatta riktningen till elefanter med hjälp av geofoner som mäter vibrationer i marken. Elefanter är stora djur som skapar tydliga vibrationer i marken när de går. Genom att mäta dessa vibrationer med geofoner kan vi uppskatta riktningen till elefanten. Vi visar att traditionella metoder kan uppskatta riktningen med hög noggrannhet på ett avstånd upp till 40 meter. Genom att avgöra när elefanter närmar sig människor och varifrån de kommer kan parkvakter vidta åtgärder för att undvika konflikter mellan människor och elefanter, vilket är ett stort problem i vissa delar av världen.
Publisher: Linköping University Electronic Press
ISBN: 9180758304
Category :
Languages : en
Pages : 93
Book Description
Direction of arrival (DOA) estimation is a well-established problem in signal processing. It involves determining the direction from which a signal reaches a sensor array, and is fundamental in applications like radar, sonar, and acoustics. Traditionally, DOA estimation relies on comparing the time of arrival of the signal across different sensors in the array. However, this approach is sensitive to the time difference of arrival (TDOA) between sensors, which can be challenging to estimate accurately. Additionally, precise synchronization among the sensors is essential, but this can be difficult to achieve in certain environments or applications. In this thesis, we explore a novel approach to DOA estimation based on the received signal power at the sensors. The method exploits the directional sensitivity of the microphones in the array, which defines how effectively each microphone captures sound from different directions. To model the directional sensitivity, we use a Fourier series (FS) model. The model is then used to estimate the DOA of a sound source across various environments, and for different types of signals. The parametric model enables Cramér-Rao lower bound (CRLB) analysis of the DOA estimation problem. Our findings demonstrate that the directional sensitivity exhibits a significant variation in accordance with the frequency content of the signal, and we exploit this to estimate the DOA for different types of sounds. The proposed method has been validated with a range of signals, including gunshots, elephant trumpets, sirens, and female screams. The results show that the developed method achieves high accuracy in estimating the DOA for the above-mentioned signals. Furthermore, the method performs similarly well in outdoor scenarios with realistic background noise levels. When compared to state-of-the-art DOA estimation techniques, our approach performs better or equally well for the investigated sounds. A key advantage of this method is that it does not require any TDOA measurement between the microphones, enabling the design of smaller, more compact devices. This opens up new possibilities for estimating DOA in environments where traditional methods are impractical. A limitation, however, is that the method requires knowledge of the microphone’s directional sensitivity, which necessitates calibration in an anechoic chamber. Nevertheless, this calibration has proven to be robust, and only needs to be performed once to create a model applicable across different environments. Additionally, this thesis explores a different application of DOA estimation, where geophones are used to estimate the DOA to elephants. As elephants move, they generate ground vibrations, and these signals can be captured by geophones. We show that a traditional delay-and-sum beamformer can accurately estimate the DOA of elephants at distances up to 40 meters. By determining when elephants are approaching and from which direction, park rangers can take early measures to avoid conflicts between humans and elephants, which is a major problem in some parts of the world. Förmågan att höra var ett ljud kommer ifrån, något vi ofta tar för givet, kallas för riktningsuppfattning. Den gör det möjligt för oss att snabbt avgöra om någon ropar på oss och från vilket håll ljudet kommer. Denna förmåga är viktig för att kunna orientera sig i omgivningen och uppfatta hot eller andra viktiga ljud. Våra öron samarbetar genom att jämföra hur ljud når varje öra, både när det gäller ljudets intensitet och hur lång tid det tar för ljudet att nå dem. Det här kallas för interaural tids- och nivåskillnad. Vissa ljud kan dock vara svåra att uppfatta, till exempel om ljudet är kort och impulsivt, eller om det är i en stadsmiljö med mycket bakgrundsljud och reflektioner. I den här avhandlingen undersöker vi nya metoder för att uppskatta ljudets riktning. Vi använder mikrofoner för att mäta ljudet och beräknar därefter riktningen som ljudet kommer ifrån. Traditionella metoder fokuserar på tidsskillnaden mellan ljud som registreras i olika mikrofoner. Vi tar istället en annan väg och undersöker hur ljudets styrka kan användas för att avgöra riktningen, oavsett tidsskillnader mellan mikrofonerna. Vår metod bygger på att vi skapar en modell av mikrofonernas riktningskänslighet, det vill säga hur väl de uppfattar ljud från olika håll. Modellen skapas genom att mäta mikrofonens riktningskänslighet i ett ekofritt rum. Genom att först mäta detta i en kontrollerad miljö, utan ekon, kan vi sedan använda modellen för att beräkna ljudriktningen i mer varierande miljöer och för olika typer av ljud. Till exempel har vi använt ljud såsom pistolskott, elefanttrumpeter, sirener och skrik för att testa vår metod. Resultaten visar att vår metod kan beräkna riktningar med hög noggrannhet för de ovan nämnda ljuden, även i en utomhusmiljö med mer realistiska nivåer av bakgrundsljud. När vi jämfört vår metod med traditionella metoder, presterar vår lösning lika bra eller bättre för de testade ljuden. En stor fördel med vår metod är att den inte kräver att mikrofonerna är placerade på ett visst avstånd från varandra, vilket innebär att vi kan bygga mindre och mer kompakta enheter. Detta kan leda till nya typer av produkter för att identifiera ljudriktningar i olika situationer. En nackdel är dock att mikrofonernas riktningskänslighet måste kalibreras i ett ljudlabb, men denna kalibrering har visat sig vara robust och det räcker att utföra en kalibrering som kan användas i flera olika miljöer. I avhandlingen inkluderas även en annan tillämpning av riktningsskattning, nämligen att uppskatta riktningen till elefanter med hjälp av geofoner som mäter vibrationer i marken. Elefanter är stora djur som skapar tydliga vibrationer i marken när de går. Genom att mäta dessa vibrationer med geofoner kan vi uppskatta riktningen till elefanten. Vi visar att traditionella metoder kan uppskatta riktningen med hög noggrannhet på ett avstånd upp till 40 meter. Genom att avgöra när elefanter närmar sig människor och varifrån de kommer kan parkvakter vidta åtgärder för att undvika konflikter mellan människor och elefanter, vilket är ett stort problem i vissa delar av världen.
Adaptive Dynamic Programming for Control
Author: Huaguang Zhang
Publisher: Springer Science & Business Media
ISBN: 144714757X
Category : Technology & Engineering
Languages : en
Pages : 432
Book Description
There are many methods of stable controller design for nonlinear systems. In seeking to go beyond the minimum requirement of stability, Adaptive Dynamic Programming in Discrete Time approaches the challenging topic of optimal control for nonlinear systems using the tools of adaptive dynamic programming (ADP). The range of systems treated is extensive; affine, switched, singularly perturbed and time-delay nonlinear systems are discussed as are the uses of neural networks and techniques of value and policy iteration. The text features three main aspects of ADP in which the methods proposed for stabilization and for tracking and games benefit from the incorporation of optimal control methods: • infinite-horizon control for which the difficulty of solving partial differential Hamilton–Jacobi–Bellman equations directly is overcome, and proof provided that the iterative value function updating sequence converges to the infimum of all the value functions obtained by admissible control law sequences; • finite-horizon control, implemented in discrete-time nonlinear systems showing the reader how to obtain suboptimal control solutions within a fixed number of control steps and with results more easily applied in real systems than those usually gained from infinite-horizon control; • nonlinear games for which a pair of mixed optimal policies are derived for solving games both when the saddle point does not exist, and, when it does, avoiding the existence conditions of the saddle point. Non-zero-sum games are studied in the context of a single network scheme in which policies are obtained guaranteeing system stability and minimizing the individual performance function yielding a Nash equilibrium. In order to make the coverage suitable for the student as well as for the expert reader, Adaptive Dynamic Programming in Discrete Time: • establishes the fundamental theory involved clearly with each chapter devoted to a clearly identifiable control paradigm; • demonstrates convergence proofs of the ADP algorithms to deepen understanding of the derivation of stability and convergence with the iterative computational methods used; and • shows how ADP methods can be put to use both in simulation and in real applications. This text will be of considerable interest to researchers interested in optimal control and its applications in operations research, applied mathematics computational intelligence and engineering. Graduate students working in control and operations research will also find the ideas presented here to be a source of powerful methods for furthering their study.
Publisher: Springer Science & Business Media
ISBN: 144714757X
Category : Technology & Engineering
Languages : en
Pages : 432
Book Description
There are many methods of stable controller design for nonlinear systems. In seeking to go beyond the minimum requirement of stability, Adaptive Dynamic Programming in Discrete Time approaches the challenging topic of optimal control for nonlinear systems using the tools of adaptive dynamic programming (ADP). The range of systems treated is extensive; affine, switched, singularly perturbed and time-delay nonlinear systems are discussed as are the uses of neural networks and techniques of value and policy iteration. The text features three main aspects of ADP in which the methods proposed for stabilization and for tracking and games benefit from the incorporation of optimal control methods: • infinite-horizon control for which the difficulty of solving partial differential Hamilton–Jacobi–Bellman equations directly is overcome, and proof provided that the iterative value function updating sequence converges to the infimum of all the value functions obtained by admissible control law sequences; • finite-horizon control, implemented in discrete-time nonlinear systems showing the reader how to obtain suboptimal control solutions within a fixed number of control steps and with results more easily applied in real systems than those usually gained from infinite-horizon control; • nonlinear games for which a pair of mixed optimal policies are derived for solving games both when the saddle point does not exist, and, when it does, avoiding the existence conditions of the saddle point. Non-zero-sum games are studied in the context of a single network scheme in which policies are obtained guaranteeing system stability and minimizing the individual performance function yielding a Nash equilibrium. In order to make the coverage suitable for the student as well as for the expert reader, Adaptive Dynamic Programming in Discrete Time: • establishes the fundamental theory involved clearly with each chapter devoted to a clearly identifiable control paradigm; • demonstrates convergence proofs of the ADP algorithms to deepen understanding of the derivation of stability and convergence with the iterative computational methods used; and • shows how ADP methods can be put to use both in simulation and in real applications. This text will be of considerable interest to researchers interested in optimal control and its applications in operations research, applied mathematics computational intelligence and engineering. Graduate students working in control and operations research will also find the ideas presented here to be a source of powerful methods for furthering their study.