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

Physical Sciences and Mathematics Commons

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

Artificial Intelligence and Robotics

PDF

2008

Institution
Keyword
Publication
Publication Type

Articles 1 - 30 of 51

Full-Text Articles in Physical Sciences and Mathematics

An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Peter Mcburney, Simon Parsons Dec 2008

An Analysis Of Entries In The First Tac Market Design Competition, Jinzhong Niu, Kai Cai, Peter Mcburney, Simon Parsons

Publications and Research

This paper presents an analysis of entries in the first TAC Market Design Competition final that compares the entries across several scenarios. The analysis complements previous work analyzing the 2007 competition, demonstrating some vulnerabilities of entries that placed highly in the competition. The paper also suggests a simple strategy that would have performed well.


Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau Dec 2008

Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments, we show that under stochastic conditions the performance variation of the process decreases as the time frame length (time …


Video Event Detection Using Motion Relativity And Visual Relatedness, Feng Wang, Yu-Gang Jiang, Chong-Wah Ngo Oct 2008

Video Event Detection Using Motion Relativity And Visual Relatedness, Feng Wang, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Event detection plays an essential role in video content analysis. However, the existing features are still weak in event detection because: i) most features just capture what is involved in an event or how the event evolves separately, and thus cannot completely describe the event; ii) to capture event evolution information, only motion distribution over the whole frame is used which proves to be noisy in unconstrained videos; iii) the estimated object motion is usually distorted by camera movement. To cope with these problems, in this paper, we propose a new motion feature, namely Expanded Relative Motion Histogram of Bag-ofVisual-Words …


Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan Oct 2008

Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

We propose, theorize and implement the Recursive Pattern-based Hybrid Supervised (RPHS) learning algorithm. The algorithm makes use of the concept of pseudo global optimal solutions to evolve a set of neural networks, each of which can solve correctly a subset of patterns. The pattern-based algorithm uses the topology of training and validation data patterns to find a set of pseudo-optima, each learning a subset of patterns. It is therefore well adapted to the pattern set provided. We begin by showing that finding a set of local optimal solutions is theoretically equivalent, and more efficient, to finding a single global optimum …


A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge Sep 2008

A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge

Research Collection School Of Computing and Information Systems

Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the mixed integer programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly …


Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao Sep 2008

Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao

Research Collection School Of Computing and Information Systems

We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, …


A Secure Group Communication Architecture For Autonomous Unmanned Aerial Vehicles, Adrian N. Phillips, Barry E. Mullins, Richard Raines, Rusty O. Baldwin Aug 2008

A Secure Group Communication Architecture For Autonomous Unmanned Aerial Vehicles, Adrian N. Phillips, Barry E. Mullins, Richard Raines, Rusty O. Baldwin

Faculty Publications

This paper investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MATLAB. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the …


Relationship Preserving Auction For Repeated E-Procurement, Park J., Lee J., Lau H. Aug 2008

Relationship Preserving Auction For Repeated E-Procurement, Park J., Lee J., Lau H.

Research Collection School Of Computing and Information Systems

While e-procurement auction has helped firms to achieve lower procurement costs, auction mechanisms that prevail at present in procurement markets need to address an important issue that concerns the ability to maintain long term relationships with the partners, especially in repeated e-procurement settings. In this paper, we propose a Relationship Preserving Auction (RPA) mechanism that augments the conventional auction mechanism with a bidder relationship scoring model. Our proposed mechanism gives increased chances of winning to the bidders who have bidden at relatively competitive price but had comparatively less wins so far. Keeping these bidders in the auction over time will …


Scaling Ant Colony Optimization With Hierarchical Reinforcement Learning Partitioning, Erik J. Dries, Gilbert L. Peterson Jul 2008

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

Faculty Publications

This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. This paper describes two specific implementations of the new algorithm: the first a modification to Dietterich’s MAXQ-Q HRL algorithm, the second a hierarchical ant colony system 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, with the modified ant colony optimization method, Ant-Q. This algorithm, MAXQ-AntQ, converges to solutions …


Modeling Of Fermentation Processes Using Online Kernel Learning Algorithm, Yi Liu Jul 2008

Modeling Of Fermentation Processes Using Online Kernel Learning Algorithm, Yi Liu

Dr. Yi Liu

No abstract provided.


Adaptive Control Of A Class Of Nonlinear Discrete-Time Systems With Online Kernel Learning, Yi Liu Jul 2008

Adaptive Control Of A Class Of Nonlinear Discrete-Time Systems With Online Kernel Learning, Yi Liu

Dr. Yi Liu

No abstract provided.


Modeling Of Fermentation Processes Using Online Kernel Learning Algorithm, Yi Liu, Haiqing Wang, Ping Li Jul 2008

Modeling Of Fermentation Processes Using Online Kernel Learning Algorithm, Yi Liu, Haiqing Wang, Ping Li

Dr. Yi Liu

A novel online identification method is developed for nonlinear multi-input multi-output process modeling issue, which is based on kernel learning framework and named as online kernel learning (OKL) algorithm in this paper. This proposed approach can adaptively control its complexity and thus acquire controlled generalization ability. The OKL algorithm performs first a forward increasing for incorporating a “new” online sample and then a backward decreasing for pruning an “old” one, both in a recursive manner. Furthermore, the prior knowledge about process can be easily integrated into the OKL scheme to improve its performance. Numerical simulations on a fed-batch penicillin fermentation …


A Simplex Model For Layered Niche Networks, Philip Fraundorf Jul 2008

A Simplex Model For Layered Niche Networks, Philip Fraundorf

Physics Faculty Works

No abstract provided.


H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings Jul 2008

H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings

Research Collection School Of Computing and Information Systems

In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential in size. The basic DPOP always communicates all possible assignments, even when some of them may be inconsistent due to hard constraints. Many real problems contain hard constraints that significantly reduce the space of feasible assignments. This paper introduces H-DPOP, a hybrid algorithm that is based on DPOP, which uses Constraint Decision Diagrams (CDD) to rule out infeasible assignments, and thus compactly …


Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith Jul 2008

Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith

Research Collection School Of Computing and Information Systems

In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably juggling multiple concurrent streams of tasks (or work flows) of varying importance and urgency. There is uncertainty with respect to the duration of a pending task as well as the amount of follow-on work that may be generated as a result of executing the task. The user’s goal is to be as productive as possible; i.e., to execute tasks that realize the maximum cumulative payoff. This is achieved by enabling …


Multi-View Ear Recognition Based On B-Spline Pose Manifold Construction, Zhiyuan Zhang, Heng Liu Jun 2008

Multi-View Ear Recognition Based On B-Spline Pose Manifold Construction, Zhiyuan Zhang, Heng Liu

Research Collection School Of Computing and Information Systems

In this work, multi-view ear recognition problems are examined in detail. A new multi-view ear recognition approach based on B-Spline pose manifold construction in discriminative projection space which is formed by null kernel discriminant analysis (NKDA) feature extraction is presented. Many experiments and comparisons are provided to show the effectiveness of our multi-view ear recognition approach.


Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath Jun 2008

Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath

Research Collection School Of Computing and Information Systems

Software personal assistants continue to be a topic of significant research interest. This article outlines some of the important lessons learned from a successfully-deployed team of personal assistant agents (Electric Elves) in an office environment. In the Electric Elves project, a team of almost a dozen personal assistant agents were continually active for seven months. Each elf (agent) represented one person and assisted in daily activities in an actual office environment. This project led to several important observations about privacy, adjustable autonomy, and social norms in office environments. In addition to outlining some of the key lessons learned we outline …


Characterizing Effective Auction Mechanisms: Insights From The 2007 Tac Mechanism Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney May 2008

Characterizing Effective Auction Mechanisms: Insights From The 2007 Tac Mechanism Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney

Publications and Research

This paper analyzes the entrants to the 2007 TAC Market Design competition. It presents a classification of the entries to the competition, and uses this classification to compare these entries. The paper also attempts to relate market dynamics to the auction rules adopted by these entries and their adaptive strategies via a set of post-tournament experiments. Based on this analysis, the paper speculates about the design of effective auction mechanisms, both in the setting of this competition and in the more general case.


Jcat: A Platform For The Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney, Thierry Moyaux, Steve Phelps, David Shield May 2008

Jcat: A Platform For The Tac Market Design Competition, Jinzhong Niu, Kai Cai, Simon Parsons, Enrico Gerding, Peter Mcburney, Thierry Moyaux, Steve Phelps, David Shield

Publications and Research

No abstract provided.


K-Means+Id3 And Dependence Tree Methods For Supervised Anomaly Detection, Kiran S. Balagani Apr 2008

K-Means+Id3 And Dependence Tree Methods For Supervised Anomaly Detection, Kiran S. Balagani

Doctoral Dissertations

In this dissertation, we present two novel methods for supervised anomaly detection. The first method "K-Means+ID3" performs supervised anomaly detection by partitioning the training data instances into k clusters using Euclidean distance similarity. Then, on each cluster representing a density region of normal or anomaly instances, an ID3 decision tree is built. The ID3 decision tree on each cluster refines the decision boundaries by learning the subgroups within a cluster. To obtain a final decision on detection, the k-Means and ID3 decision trees are combined using two rules: (1) the nearest neighbor rule; and (2) the nearest consensus rule. The …


Wireless Sensor Network Modeling Using Modified Recurrent Neural Network: Application To Fault Detection, Azzam Issam Moustapha Apr 2008

Wireless Sensor Network Modeling Using Modified Recurrent Neural Network: Application To Fault Detection, Azzam Issam Moustapha

Doctoral Dissertations

Wireless Sensor Networks (WSNs) consist of a large number of sensors, which in turn have their own dynamics. They interact with each other and the base station, which controls the network. In multi-hop wireless sensor networks, information hops from one node to another and finally to the network gateway or base station. Dynamic Recurrent Neural Networks (RNNs) consist of a set of dynamic nodes that provide internal feedback to their own inputs. They can be used to simulate and model dynamic systems such as a network of sensors.

In this dissertation, a dynamic model of wireless sensor networks and its …


Behavior-Based Power Management In Autonomous Mobile Robots, Charles A. Fetzek Mar 2008

Behavior-Based Power Management In Autonomous Mobile Robots, Charles A. Fetzek

Theses and Dissertations

Current attempts to prolong the life of a robot on a single battery charge focus on lowering the operating frequency of the onboard hardware, or allowing devices to go to sleep during idle states. These techniques have much overhead and do not come built in to the underlying robotic architecture. In this thesis, battery life is greatly extended through development of a behavior-based power management system, including a Markov decision process power planner, thereby allowing future robots increased time to operate and loiter in their required domain. Behavior-based power management examines sensors needed by the currently active behavior set and …


A Secure Group Communication Architecture For A Swarm Of Autonomous Unmanned Aerial Vehicles, Adrian N. Phillips Mar 2008

A Secure Group Communication Architecture For A Swarm Of Autonomous Unmanned Aerial Vehicles, Adrian N. Phillips

Theses and Dissertations

This thesis investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MatLab. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the …


Dynamic Behavior Sequencing In A Hybrid Robot Architecture, Jeffrey P. Duffy Mar 2008

Dynamic Behavior Sequencing In A Hybrid Robot Architecture, Jeffrey P. Duffy

Theses and Dissertations

Hybrid robot control architectures separate plans, coordination, and actions into separate processing layers to provide deliberative and reactive functionality. This approach promotes more complex systems that perform well in goal-oriented and dynamic environments. In various architectures, the connections and contents of the functional layers are tightly coupled so system updates and changes require major changes throughout the system. This work proposes an abstract behavior representation, a dynamic behavior hierarchy generation algorithm, and an architecture design to reduce this major change incorporation process. The behavior representation provides an abstract interface for loose coupling of behavior planning and execution components. The hierarchy …


Exploitation Of Self Organization In Uav Swarms For Optimization In Combat Environments, Dustin J. Nowak Mar 2008

Exploitation Of Self Organization In Uav Swarms For Optimization In Combat Environments, Dustin J. Nowak

Theses and Dissertations

This investigation focuses primarily on the development of effective target engagement for unmanned aerial vehicle (UAV) swarms using autonomous self-organized cooperative control. This development required the design of a new abstract UAV swarm control model which flows from an abstract Markov structure, a Partially Observable Markov Decision Process. Self-organization features, bio-inspired attack concepts, evolutionary computation (multi-objective genetic algorithms, differential evolution), and feedback from environmental awareness are instantiated within this model. The associated decomposition technique focuses on the iterative deconstruction of the problem domain state and dynamically building-up of self organizational rules as related to the problem domain environment. Resulting emergent …


Conceptual Study Of Rotary-Wing Microrobotics, Kelson D. Chabak Mar 2008

Conceptual Study Of Rotary-Wing Microrobotics, Kelson D. Chabak

Theses and Dissertations

This thesis presents a novel rotary-wing micro-electro-mechanical systems (MEMS) robot design. Two MEMS wing designs were designed, fabricated and tested including one that possesses features conducive to insect level aerodynamics. Two methods for fabricating an angled wing were also attempted with photoresist and CrystalBond™ to create an angle of attack. One particular design consisted of the wing designs mounted on a gear which are driven by MEMS actuators. MEMS comb drive actuators were analyzed, simulated and tested as a feasible drive system. The comb drive resonators were also designed orthogonally which successfully rotated a gear without wings. With wings attached …


Ant Clustering With Locally Weighting Ant Perception And Diversified Memory, Gilbert L. Peterson, Christopher B. Mayer, Thomas L. Kubler Mar 2008

Ant Clustering With Locally Weighting Ant Perception And Diversified Memory, Gilbert L. Peterson, Christopher B. Mayer, Thomas L. Kubler

Faculty Publications

Ant clustering algorithms are a robust and flexible tool for clustering data that have produced some promising results. This paper introduces two improvements that can be incorporated into any ant clustering algorithm: kernel function similarity weights and a similarity memory model replacement scheme. A kernel function weights objects within an ant’s neighborhood according to the object distance and provides an alternate interpretation of the similarity of objects in an ant’s neighborhood. Ants can hill-climb the kernel gradients as they look for a suitable place to drop a carried object. The similarity memory model equips ants with a small memory consisting …


A Practical Approach To Robotic Design For The Darpa Urban Challenge, Benjamin J. Patz, Yiannis Papelis, Remo Pillat, Gary Stein, Don Harper Jan 2008

A Practical Approach To Robotic Design For The Darpa Urban Challenge, Benjamin J. Patz, Yiannis Papelis, Remo Pillat, Gary Stein, Don Harper

VMASC Publications

This article presents a practical approach to engineering a robot to effectively navigate in an urban environment. Inherent in this approach is the use of relatively simple sensors, actuators, and processors to generate robot vision, intelligence, and planning. Sensor data are fused from multiple low-cost, two-dimensional laser scanners With an innovative rotational mount to provide three-dimensional coverage with image processing using both range and intensity data. Information is combined With Doppler radar returns to yield a world view processed by a context-based reasoning control system to yield tactical mission commands forwarded to traditional proportional-integral-derivative (PID) control loops. As an example …


Double Cross Playing Diamonds, Rudolf Kaehr Jan 2008

Double Cross Playing Diamonds, Rudolf Kaehr

Rudolf Kaehr

Understanding interactivity in/between bigraphs and diamonds Grammatologically, the Western notational system is not offering space in itself to place sameness and otherness necessary to realize interaction/ality. Alphabetism is not prepared to challenge the dynamics of interaction directly. The Chinese writing system in its scriptural structuration, is able to place complex differences into itself, necessary for the development and design of formal systems and programming languages of interaction. The challenge of interactionality to Western thinking, modeling and design interactivity has to be confronted with the decline of the scientific power of alpha-numeric notational systems as media of living in a complex …


Short Studies 2008. Adventures In Diamond Strategies Of Change(S), Rudolf Kaehr Jan 2008

Short Studies 2008. Adventures In Diamond Strategies Of Change(S), Rudolf Kaehr

Rudolf Kaehr

Modular Bolognese Paradoxes of postmodern education. A Tale of Fishes, Birds and Diamonds in Second-Order Epistemology Why it is useless to write about the mono-contexturality of alphabetism and digitalism Chez Maxime's Human rights in a polycontextural world Primary Thoughts to a Manifesto for Awareness Fashion Marketing Which Equality? How equal are equal human beings? Generalized Diamonds From monosemic to tectonic complementarity Diamond Disremption Diamond interpretation of the kenomic succession operation Diamond Web2.0? How social is social networking? Web Mobility Web computing between semiotic and kenomic spaces Double Cross Playing Diamonds Understanding interactivity in/between bigraphs and diamonds Morphogrammatics of Change A …