Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 10 of 10

Full-Text Articles in Entire DC Network

A Unified Framework For Solving Multiagent Task Assignment Problems, Kevin Cousin Dec 2007

A Unified Framework For Solving Multiagent Task Assignment Problems, Kevin Cousin

Theses and Dissertations

Multiagent task assignment problem descriptors do not fully represent the complex interactions in a multiagent domain, and algorithmic solutions vary widely depending on how the domain is represented. This issue is compounded as related research fields contain descriptors that similarly describe multiagent task assignment problems, including complex domain interactions, but generally do not provide the mechanisms needed to solve the multiagent aspect of task assignment. This research presents a unified approach to representing and solving the multiagent task assignment problem for complex problem domains. Ideas central to multiagent task allocation, project scheduling, constraint satisfaction, and coalition formation are combined to …


A Hybrid Multi-Robot Control Architecture, Daylond J. Hooper Dec 2007

A Hybrid Multi-Robot Control Architecture, Daylond J. Hooper

Theses and Dissertations

Multi-robot systems provide system redundancy and enhanced capability versus single robot systems. Implementations of these systems are varied, each with specific design approaches geared towards an application domain. Some traditional single robot control architectures have been expanded for multi-robot systems, but these expansions predominantly focus on the addition of communication capabilities. Both design approaches are application specific and limit the generalizability of the system. This work presents a redesign of a common single robot architecture in order to provide a more sophisticated multi-robot system. The single robot architecture chosen for application is the Three Layer Architecture (TLA). The primary strength …


Scaling Ant Colony Optimization With Hierarchical Reinforcement Learning Partitioning, Erik J. Dries Sep 2007

Scaling Ant Colony Optimization With Hierarchical Reinforcement Learning Partitioning, Erik J. Dries

Theses and Dissertations

This research merges the hierarchical reinforcement learning (HRL) domain and the ant colony optimization (ACO) domain. The merger produces a HRL ACO algorithm capable of generating solutions for both domains. This research also provides two specific implementations of the new algorithm: the first a modification to Dietterich's MAXQ-Q HRL algorithm, the second a hierarchical ACO algorithm. These implementations generate faster results, with little to no significant change in the quality of solutions for the tested problem domains. The application of ACO to the MAXQ-Q algorithm replaces the reinforcement learning, Q-learning and SARSA, with the modified ant colony optimization method, Ant-Q. …


Multi-Objective Optimization For Speed And Stability Of A Sony Aibo Gait, Christopher A. Patterson Sep 2007

Multi-Objective Optimization For Speed And Stability Of A Sony Aibo Gait, Christopher A. Patterson

Theses and Dissertations

Locomotion is a fundamental facet of mobile robotics that many higher level aspects rely on. However, this is not a simple problem for legged robots with many degrees of freedom. For this reason, machine learning techniques have been applied to the domain. Although impressive results have been achieved, there remains a fundamental problem with using most machine learning methods. The learning algorithms usually require a large dataset which is prohibitively hard to collect on an actual robot. Further, learning in simulation has had limited success transitioning to the real world. Also, many learning algorithms optimize for a single fitness function, …


Parallelization Of Ant Colony Optimization Via Area Of Expertise Learning, Adrian A. De Freitas Sep 2007

Parallelization Of Ant Colony Optimization Via Area Of Expertise Learning, Adrian A. De Freitas

Theses and Dissertations

Ant colony optimization algorithms have long been touted as providing an effective and efficient means of generating high quality solutions to NP-hard optimization problems. Unfortunately, while the structure of the algorithm is easy to parallelize, the nature and amount of communication required for parallel execution has meant that parallel implementations developed suffer from decreased solution quality, slower runtime performance, or both. This thesis explores a new strategy for ant colony parallelization that involves Area of Expertise (AOE) learning. The AOE concept is based on the idea that individual agents tend to gain knowledge of different areas of the search space …


Genetic Evolution Of Hierarchical Behavior Structures, Brian G. Woolley, Gilbert L. Peterson Jul 2007

Genetic Evolution Of Hierarchical Behavior Structures, Brian G. Woolley, Gilbert L. Peterson

Faculty Publications

The development of coherent and dynamic behaviors for mobile robots is an exceedingly complex endeavor ruled by task objectives, environmental dynamics and the interactions within the behavior structure. This paper discusses the use of genetic programming techniques and the unified behavior framework to develop effective control hierarchies using interchangeable behaviors and arbitration components. Given the number of possible variations provided by the framework, evolutionary programming is used to evolve the overall behavior design. Competitive evolution of the behavior population incrementally develops feasible solutions for the domain through competitive ranking. By developing and implementing many simple behaviors independently and then evolving …


An Artificial Immune System-Inspired Multiobjective Evolutionary Algorithm With Application To The Detection Of Distributed Computer Network Intrusions, Charles R. Haag, Gary B. Lamont, Paul D. L. Williams, Gilbert L. Peterson Jul 2007

An Artificial Immune System-Inspired Multiobjective Evolutionary Algorithm With Application To The Detection Of Distributed Computer Network Intrusions, Charles R. Haag, Gary B. Lamont, Paul D. L. Williams, Gilbert L. Peterson

Faculty Publications

Today's signature-based intrusion detection systems are reactive in nature and storage-limited. Their operation depends upon catching an instance of an intrusion or virus and encoding it into a signature that is stored in its anomaly database, providing a window of vulnerability to computer systems during this time. Further, the maximum size of an Internet Protocol-based message requires the database to be huge in order to maintain possible signature combinations. In order to tighten this response cycle within storage constraints, this paper presents an innovative Artificial Immune System-inspired Multiobjective Evolutionary Algorithm. This distributed intrusion detection system (IDS) is intended to measure …


Wide Area Search And Engagement Simulation Validation, Michael J. Marlin Mar 2007

Wide Area Search And Engagement Simulation Validation, Michael J. Marlin

Theses and Dissertations

As unmanned aerial vehicles (UAVs) increase in capability, the ability to refuel them in the air is becoming more critical. Aerial refueling will extend the range, shorten the response times, and extend loiter time of UAVs. Executing aerial refueling autonomously will reduce the command and control, logistics, and training efforts associated with fielding UAV systems. Currently, the Air Force Research Lab is researching the various technologies required to conduct automated aerial refueling (AAR). One of the required technologies is the ability to autonomously rendezvous with the tanker. The goal of this research is to determine the control required to fly …


Multi-Robot Fastslam For Large Domains, Choyong G. Koperski Mar 2007

Multi-Robot Fastslam For Large Domains, Choyong G. Koperski

Theses and Dissertations

For a robot to build a map of its surrounding area, it must have accurate position information within the area, and to obtain accurate position information within the area, the robot needs to have an accurate map of the area. This circular problem is the Simultaneous Localization and Mapping (SLAM) problem. An efficient algorithm to solve it is FastSLAM, which is based on the Rao-Blackwellized particle filter. FastSLAM solves the SLAM problem for single-robot mapping using particles to represent the posterior of the robot pose and the map. Each particle of the filter possesses its own global map which is …


Performance Evaluation Of Ad Hoc Routing In A Swarm Of Autonomous Aerial Vehicles, Matthew T. Hyland Mar 2007

Performance Evaluation Of Ad Hoc Routing In A Swarm Of Autonomous Aerial Vehicles, Matthew T. Hyland

Theses and Dissertations

This thesis investigates the performance of three mobile ad hoc routing protocols in the context of a swarm of autonomous unmanned aerial vehicles (UAVs). It is proposed that a wireless network of nodes having an average of 5.1774 log n neighbors, where n is the total number of nodes in the network, has a high probability of having no partitions. By decreasing transmission range while ensuring network connectivity, and implementing multi-hop routing between nodes, spatial multiplexing is exploited whereby multiple pairs of nodes simultaneously transmit on the same channel. The proposal is evaluated using the Greedy Perimeter Stateless Routing (GPSR), …