Dan Simon

Dr. Dan Simon

Department of Electrical Engineering and Computer Science, Cleveland State University, Cleveland, OH, USA

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2008 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
DSDan Simon
Dan Simon
Biogeography is the study of the geographical distribution of biological organisms. Mathematical equations that govern the distribution of organisms were first discovered and developed during the 1960s. The mindset of the engineer is that we can learn from nature. This motivates the application of biogeography to optimization problems. Just as the mathematics of biological genetics inspired the development of genetic algorithms (GAs), and the mathematics of biological neurons inspired the development of artificial neural networks, this paper considers the mathematics of biogeography as the basis for the development of a new field: biogeography-based optimization (BBO). We discuss natural biogeography and its mathematics, and then discuss how it can be used to solve optimization problems. We see that BBO has features in common with other biology-based optimization methods, such as GAs and particle swarm optimization (PSO). This makes BBO applicable to many of the same types of problems that GAs and PSO are used for, namely, high-dimension problems with multiple local optima. However, BBO also has some features that are unique among biology-based optimization methods. We demonstrate the performance of BBO on a set of 14 standard benchmarks and compare it with seven other biology-based optimization algorithms. We also demonstrate BBO on a real-world sensor selection problem for aircraft engine health estimation.

6 August 2010 in IET Control Theory & Applications
Verified
Journal Article
Closed access
DSDan Simon
Dan Simon
The Kalman filter is the minimum-variance state estimator for linear dynamic systems with Gaussian noise. Even if the noise is non-Gaussian, the Kalman filter is the best linear estimator. For nonlinear systems it is not possible, in general, to derive the optimal state estimator in closed form, but various modifications of the Kalman filter can be used to estimate the state. These modifications include the extended Kalman filter, the unscented Kalman filter, and the particle filter. Although the Kalman filter and its modifications are powerful tools for state estimation, we might have information about a system that the Kalman filter does not incorporate. For example, we may know that the states satisfy equality or inequality constraints. In this case we can modify the Kalman filter to exploit this additional information and get better filtering performance than the Kalman filter provides. This paper provides an overview of various ways to incorporate state constraints in the Kalman filter and its nonlinear modifications. If both the system and state constraints are linear, then all of these different approaches result in the same state estimate, which is the optimal constrained linear state estimate. If either the system or constraints are nonlinear, then constrained filtering is, in general, not optimal, and different approaches give different results.

7 August 2002 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
DSDan Simon
Dan Simon
TCTien Li Chia
Tien Li Chia
Kalman filters are commonly used to estimate the states of a dynamic system. However, in the application of Kalman filters there is often known model or signal information that is either ignored or dealt with heuristically. For instance, constraints on state values (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. A rigorous analytic method of incorporating state equality constraints in the Kalman filter is developed. The constraints may be time varying. At each time step the unconstrained Kalman filter solution is projected onto the state constraint surface. This significantly improves the prediction accuracy of the filter. The use of this algorithm is demonstrated on a simple nonlinear vehicle tracking problem.

1 April 2011 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Open access
HMHaiping Ma
Haiping Ma
DSDan Simon
Dan Simon

1 February 2010 in International Journal of Systems Science
Verified
Journal Article
Closed access
DSDan Simon
Dan Simon
DSDonald L. Simon
Donald L. Simon
Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This article develops an analytic method of incorporating state variable inequality constraints in the Kalman filter. The resultant filter truncates the probability density function (PDF) of the Kalman filter estimate at the known constraints and then computes the constrained filter estimate as the mean of the truncated PDF. The incorporation of state variable constraints increases the computational effort of the filter but also improves its estimation accuracy. The improvement is demonstrated via simulation results obtained from a turbofan engine model. It is also shown that the truncated Kalman filter may provide a more accurate way of incorporating inequality constraints than other constrained filters (e.g. the projection approach to constrained filtering).

22 September 2017 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Open access
HMHaiping Ma
Haiping Ma
DSDan Simon
Dan Simon
PSPatrick Siarry
Patrick Siarry
ZYZhile Yang
Zhile Yang
MFMinrui Fei
Minrui Fei
Biogeography-based optimization (BBO) is an evolutionary algorithm which is inspired by the migration of species between habitats. Almost 10 years have passed since the first BBO paper was published in 2008. BBO has successfully solved optimization problems in many different domains and has reached a relatively mature state. Considering the significant and expanding research on BBO and its applications, we find that the time is right to provide a 10-year anniversary review of the published literature, and also to point out some important avenues of future research. The purpose of this paper is to summarize and organize the literature related to the past 10 years of BBO research. Beginning with a foundation of basic BBO, we review the family of BBO algorithms and discuss BBO modifications, hybridizations, applications in science and engineering, and mathematical theory. Finally, the paper presents some interesting open problems and future research directions for BBO.