Gary B. Lamont
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
Gary B. Lamont has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Mark P. Kleeman2 shared publications
Brett J. Borghetti
Department of Electrical and Computer Engineering, Graduate School of Engineering and Management, Air Force Institute of Technology, Wright Patterson AFB, Dayton, OH 45433, USA
1 shared publication- Dustin J. Nowak
Dept. of Electrical and Computer Engineering, Graduate School of Engineering and Management, Air Force Institute of Technology, WPAFB, Dayton, Ohio, USA
1 shared publication - Gilbert L. Peterson
Department of Electrical and Computer Engineering, Air Force Institute of Technology, 2950 Hobson Way, Wright-Patterson AFB, Dayton, OH 45433, USA
1 shared publication - Ian C. Price
Department of Electrical and Computer Engineering, Graduate School of Engineering and Management, Air Force Institute of Technology, Wright-Patterson AFB, Dayton, OH 45433, U.S.A.
1 shared publication - James N. Slear
Department of Electrical and Computer Engineering, Graduate School of Engineering and Management, Air Force Institute of Technology, Wright-Patterson AFB, Dayton, OH 45433
1 shared publication
Latest Publications
- Open Access
- 10 March 2021
- Published by Springer Nature in Journal of Big Data
- Vol. 8 (1) , 1-21
Multi-objective database queries in combined knapsack and set covering problem domains
Database queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data. The Air Force Institute of Technology has approximately 100 data logs which will be converted to the standardized Scorpion Data Model format. A relational database is designed to house this data and its associated sensor and non-sensor metadata. Deterministic polynomial-time queries were used to test the performance of this schema against two other schemas, with databases of 100 and 1000 logs of repeated data and randomized metadata. Of these approaches, the one that had the best performance was chosen as AFIT’s database solution, and now more complex and useful queries need to be developed to enable filter research. To this end, consider the combined Multi-Objective Knapsack/Set Covering Database Query. Algorithms which address The Set Covering Problem or Knapsack Problem could be used individually to achieve useful results, but together they could offer additional power to a potential user. This paper explores the NP-Hard problem domain of the Multi-Objective KP/SCP, proposes Genetic and Hill Climber algorithms, implements these algorithms using Java, populates their data structures using SQL queries from two test databases, and finally compares how these algorithms perform.
- 10 March 2021
- Published by Springer Nature in Journal of Big Data
- Vol. 8 (1) , 1-21
Open AccessMulti-objective database queries in combined knapsack and set covering problem domains
Database queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data. The Air Force Institute of Technology has approximately 100 data logs which will be converted to the standardized Scorpion Data Model format. A relational database is designed to house this data and its associated sensor and non-sensor metadata. Deterministic polynomial-time queries were used to test the performance of this schema against two other schemas, with databases of 100 and 1000 logs of repeated data and randomized metadata. Of these approaches, the one that had the best performance was chosen as AFIT’s database solution, and now more complex and useful queries need to be developed to enable filter research. To this end, consider the combined Multi-Objective Knapsack/Set Covering Database Query. Algorithms which address The Set Covering Problem or Knapsack Problem could be used individually to achieve useful results, but together they could offer additional power to a potential user. This paper explores the NP-Hard problem domain of the Multi-Objective KP/SCP, proposes Genetic and Hill Climber algorithms, implements these algorithms using Java, populates their data structures using SQL queries from two test databases, and finally compares how these algorithms perform.
- Open Access
- 3 July 2011
- Published by Hindawi Limited in International Journal of Computer Games Technology
- Vol. 2011, 1-17
Determining Solution Space Characteristics for Real-Time Strategy Games and Characterizing Winning Strategies
The underlying goal of a competing agent in a discrete real-time strategy (RTS) game is to defeat an adversary. Strategic agents or participants must define an a priori plan to maneuver their resources in order to destroy the adversary and the adversary's resources as well as secure physical regions of the environment. This a priori plan can be generated by leveraging collected historical knowledge about the environment. This knowledge is then employed in the generation of a classification model for real-time decision-making in the RTS domain. The best way to generate a classification model for a complex problem domain depends on the characteristics of the solution space. An experimental method to determine solution space (search landscape) characteristics is through analysis of historical algorithm performance for solving the specific problem. We select a deterministic search technique and a stochastic search method for a priori classification model generation. These approaches are designed, implemented, and tested for a specific complex RTS game, Bos Wars. Their performance allows us to draw various conclusions about applying a competing agent in complex search landscapes associated with RTS games.
- 3 July 2011
- Published by Hindawi Limited in International Journal of Computer Games Technology
- Vol. 2011, 1-17
Open AccessDetermining Solution Space Characteristics for Real-Time Strategy Games and Characterizing Winning Strategies
The underlying goal of a competing agent in a discrete real-time strategy (RTS) game is to defeat an adversary. Strategic agents or participants must define an a priori plan to maneuver their resources in order to destroy the adversary and the adversary's resources as well as secure physical regions of the environment. This a priori plan can be generated by leveraging collected historical knowledge about the environment. This knowledge is then employed in the generation of a classification model for real-time decision-making in the RTS domain. The best way to generate a classification model for a complex problem domain depends on the characteristics of the solution space. An experimental method to determine solution space (search landscape) characteristics is through analysis of historical algorithm performance for solving the specific problem. We select a deterministic search technique and a stochastic search method for a priori classification model generation. These approaches are designed, implemented, and tested for a specific complex RTS game, Bos Wars. Their performance allows us to draw various conclusions about applying a competing agent in complex search landscapes associated with RTS games.
- 24 May 2011
- Published by IGI Global Scientific Publishing
- p. 388-429
Evolutionary Multi-Objective Optimization in Military Applications
Evolutionary methods are used in many fields to solve multi-objective optimization problems. Military problems are no exception. This chapter looks at a variety of military applications that have utilized evolutionary techniques for solving their problem.
- 24 May 2011
- Published by IGI Global Scientific Publishing
- p. 388-429
Evolutionary Multi-Objective Optimization in Military Applications
Evolutionary methods are used in many fields to solve multi-objective optimization problems. Military problems are no exception. This chapter looks at a variety of military applications that have utilized evolutionary techniques for solving their problem.
- 24 May 2011
- Published by IGI Global Scientific Publishing
- p. 364-387
Evolutionary Multi-Objective Optimization for Assignment Problems
Assignment problems are used throughout many research disciplines. Most assignment problems in the literature have focused on solving a single objective. This chapter focuses on assignment problems that have multiple objectives that need to be satisfied. In particular, this chapter looks at how multi-objective evolutionary algorithms have been used to solve some of these problems. Additionally, this chapter examines many of the operators that have been utilized to solve assignment problems and discusses some of the advantages and disadvantages of using specific operators.
- 24 May 2011
- Published by IGI Global Scientific Publishing
- p. 364-387
Evolutionary Multi-Objective Optimization for Assignment Problems
Assignment problems are used throughout many research disciplines. Most assignment problems in the literature have focused on solving a single objective. This chapter focuses on assignment problems that have multiple objectives that need to be satisfied. In particular, this chapter looks at how multi-objective evolutionary algorithms have been used to solve some of these problems. Additionally, this chapter examines many of the operators that have been utilized to solve assignment problems and discusses some of the advantages and disadvantages of using specific operators.
- Open Access
- 1 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 05473578,p. 183-189
Autonomous Self Organized UAV Swarm Systemis
Interest in Self-Organized (SO) unmanned aerial vehicles (UAVs) systems is increasing because of their flexibility, versatility and economics. Many countries and industries are developing autonomous and swarming UAVs for reconnaissance, surveillance, intelligence gathering, and target engagement and neutralization. The processes for effectively developing these systems are still in their infancy. Currently, little effort is focused on building simple agent rules with low-level SO systems communication in order to facilitate emergent behaviors. Note that only with the use of effective control structures can the full potential of these systems realized. Presented is an innovative new paradigm for developing SO-based autonomous vehicles. Using a formal design model, the Interactive Partially Observable Markov Decision Process, a full understanding of this SO domain is possible. With this design model and a focused effort on the minimization of computational and informational complexity, emergent entangled control hierarchies allow the SO rules to operate efficiently and effectively. This work extends the formal model decomposition technique, and in doing so ties in the information theoretic optimization to develop emergent structures. Preliminary computational results reflect limited success.
- 1 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 05473578,p. 183-189
Open AccessAutonomous Self Organized UAV Swarm Systemis
Interest in Self-Organized (SO) unmanned aerial vehicles (UAVs) systems is increasing because of their flexibility, versatility and economics. Many countries and industries are developing autonomous and swarming UAVs for reconnaissance, surveillance, intelligence gathering, and target engagement and neutralization. The processes for effectively developing these systems are still in their infancy. Currently, little effort is focused on building simple agent rules with low-level SO systems communication in order to facilitate emergent behaviors. Note that only with the use of effective control structures can the full potential of these systems realized. Presented is an innovative new paradigm for developing SO-based autonomous vehicles. Using a formal design model, the Interactive Partially Observable Markov Decision Process, a full understanding of this SO domain is possible. With this design model and a focused effort on the minimization of computational and informational complexity, emergent entangled control hierarchies allow the SO rules to operate efficiently and effectively. This work extends the formal model decomposition technique, and in doing so ties in the information theoretic optimization to develop emergent structures. Preliminary computational results reflect limited success.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE Aerospace Conference
- No. 1095323X,p. 1-14
Improving Image Resolution with Edge-Targeted Filter Evolution
Government, commercial, scientific, and defense applications in image processing often require transmission of large amounts of data across bandwidth-limited channels. Applications require robust transforms simultaneously minimizing bandwidth requirements and image resolution loss. Image processing algorithms take advantage of quantization to provide substantial lossy compression ratios at the expense of resolution. Recent research demonstrates that genetic algorithms evolve filters outperforming standard discrete wavelet transforms in conditions subject to high quantization error. While evolved filters improve overall image quality, wavelet filters typically provide a superior high frequency response, demonstrating improved reconstruction near the edges of objects within an image. This paper presents an algorithm to generate transform filters that optimize edge reconstruction, improving object edge resolution by an average of 17%. Edges within satellite images are isolated, and image transforms are evolved to optimize both the edge and non-edge portions of reconnaissance photographs. Such filters provide an increased object resolution over standard wavelets and traditionally evolved filters for varied applications of image processing.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE Aerospace Conference
- No. 1095323X,p. 1-14
Improving Image Resolution with Edge-Targeted Filter Evolution
Government, commercial, scientific, and defense applications in image processing often require transmission of large amounts of data across bandwidth-limited channels. Applications require robust transforms simultaneously minimizing bandwidth requirements and image resolution loss. Image processing algorithms take advantage of quantization to provide substantial lossy compression ratios at the expense of resolution. Recent research demonstrates that genetic algorithms evolve filters outperforming standard discrete wavelet transforms in conditions subject to high quantization error. While evolved filters improve overall image quality, wavelet filters typically provide a superior high frequency response, demonstrating improved reconstruction near the edges of objects within an image. This paper presents an algorithm to generate transform filters that optimize edge reconstruction, improving object edge resolution by an average of 17%. Edges within satellite images are isolated, and image transforms are evolved to optimize both the edge and non-edge portions of reconnaissance photographs. Such filters provide an increased object resolution over standard wavelets and traditionally evolved filters for varied applications of image processing.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 10-20
UAV Swarm Mission Planning and Routing using Multi-Objective Evolutionary Algorithms
The purpose of this research is to design and implement a comprehensive mission planning system for swarms of autonomous aerial vehicles (UAV). The system integrates several problem domains including path planning, vehicle routing, and swarm behavior as based upon a hierarchical architecture. The developed system consists of a parallel, multi-objective evolutionary algorithm-based terrain-following parallel path planner and an evolutionary algorithm-based vehicle router. Objectives include minimizing cost and risk generally associated with a three dimensional vehicle routing problem (VRP). The culmination of this effort is the development of an extensible developmental path planning model integrated with swarm behavior and tested with a parallel UAV simulation. Discussions on the system's capabilities are presented along with recommendations for further development.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 10-20
UAV Swarm Mission Planning and Routing using Multi-Objective Evolutionary Algorithms
The purpose of this research is to design and implement a comprehensive mission planning system for swarms of autonomous aerial vehicles (UAV). The system integrates several problem domains including path planning, vehicle routing, and swarm behavior as based upon a hierarchical architecture. The developed system consists of a parallel, multi-objective evolutionary algorithm-based terrain-following parallel path planner and an evolutionary algorithm-based vehicle router. Objectives include minimizing cost and risk generally associated with a three dimensional vehicle routing problem (VRP). The culmination of this effort is the development of an extensible developmental path planning model integrated with swarm behavior and tested with a parallel UAV simulation. Discussions on the system's capabilities are presented along with recommendations for further development.
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (08917736) , 1307-1315
GA Directed Self-Organized Search and Attack UAV Swarms
Self-organization offers many potential benefits to autonomous multi-UAV systems. This research investigates the use of a self-organization (SO) framework for evolving UAV swarm behavior. This SO framework is used to design a UAV swarm simulation with evolving behavior. The swarm behavior is then evolved using a genetic algorithm (GA) to successfully locate and destroy retaliating stationary targets. This system is tested using both a set of strictly homogeneous UAVs and heterogeneous UAVs with intriguing results
- 1 December 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (08917736) , 1307-1315
GA Directed Self-Organized Search and Attack UAV Swarms
Self-organization offers many potential benefits to autonomous multi-UAV systems. This research investigates the use of a self-organization (SO) framework for evolving UAV swarm behavior. This SO framework is used to design a UAV swarm simulation with evolving behavior. The swarm behavior is then evolved using a genetic algorithm (GA) to successfully locate and destroy retaliating stationary targets. This system is tested using both a set of strictly homogeneous UAVs and heterogeneous UAVs with intriguing results