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

2007

Discipline
Institution
Keyword
Publication
Publication Type

Articles 31 - 35 of 35

Full-Text Articles in Artificial Intelligence and Robotics

An Environmental Complexity Analysis For Robot-Environment System Design, Gang Yang Jan 2007

An Environmental Complexity Analysis For Robot-Environment System Design, Gang Yang

Theses and Dissertations

Recently, researchers have begun to investigate intelligent environments for robot applications. In this work, a robot and its work environment can be considered to be an integrated system. Currently, such robot-environment systems are designed on an ad-hoc basis, with the final performance of the system greatly dependent on the experience and preferences of the designer. This dissertation investigates a way to improve on this situation by looking at the complexity of an environment from the perspective of a robot. The objective of this research is to develop a method to evaluate environmental complexity and then use this information to help …


Towards Efficient Computation Of Quality Bounded Solutions In Pomdps: Expected Value Approximation And Dynamic Disjunctive Beliefs, Pradeep Reddy Varakantham, Rajiv Maheswaran, Tapana Gupta, Milind Tambe Jan 2007

Towards Efficient Computation Of Quality Bounded Solutions In Pomdps: Expected Value Approximation And Dynamic Disjunctive Beliefs, Pradeep Reddy Varakantham, Rajiv Maheswaran, Tapana Gupta, Milind Tambe

Research Collection School Of Computing and Information Systems

While POMDPs (partially observable markov decision problems) are a popular computational model with wide-ranging applications, the computational cost for optimal policy generation is prohibitive. Researchers are investigating ever-more efficient algorithms, yet many applications demand such algorithms bound any loss in policy quality when chasing efficiency. To address this challenge, we present two new techniques. The first approximates in the value space to obtain solutions efficiently for a pre-specified error bound. Unlike existing techniques, our technique guarantees the resulting policy will meet this bound. Furthermore, it does not require costly computations to determine the quality loss of the policy. Our second …


Real-Time Supply Chain Control Via Multi-Agent Adjustable Autonomy, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo Jan 2007

Real-Time Supply Chain Control Via Multi-Agent Adjustable Autonomy, Hoong Chuin Lau, Lucas Agussurja, Ramesh Thangarajoo

Research Collection School Of Computing and Information Systems

Real-time supply chain management in a rapidly changing environment requires reactive and dynamic collaboration among participating entities. In this work, we model supply chain as a multi-agent system where agents are subject to an adjustable autonomy. The autonomy of an agent refers to its capability to make and influence decisions within a multi-agent system. Adjustable autonomy means changing the autonomy of the agents during runtime as a response to changes in the environment. In the context of a supply chain, different entities will have different autonomy levels and objective functions as the environment changes, and the goal is to design …


Iterated Weaker-Than-Weak Dominance, Shih-Fen Cheng, Michael P. Wellman Jan 2007

Iterated Weaker-Than-Weak Dominance, Shih-Fen Cheng, Michael P. Wellman

Research Collection School Of Computing and Information Systems

We introduce a weakening of standard gametheoretic δ-dominance conditions, called dominance, which enables more aggressive pruning of candidate strategies at the cost of solution accuracy. Equilibria of a game obtained by eliminating a δ-dominated strategy are guaranteed to be approximate equilibria of the original game, with degree of approximation bounded by the dominance parameter. We can apply elimination of δ-dominated strategies iteratively, but the for which a strategy may be eliminated depends on prior eliminations. We discuss implications of this order independence, and propose greedy heuristics for determining a sequence of eliminations to reduce the game as far as possible …


Integrating Semantic Templates With Decision Tree For Image Semantic Learning, Ying Liu, Dengsheng Zhang, Guojun Lu, Ah-Hwee Tan Jan 2007

Integrating Semantic Templates With Decision Tree For Image Semantic Learning, Ying Liu, Dengsheng Zhang, Guojun Lu, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Decision tree (DT) has great potential in image semantic learning due to its simplicity in implementation and its robustness to incomplete and noisy data. Decision tree learning naturally requires the input attributes to be nominal (discrete). However, proper discretization of continuous-valued image features is a difficult task. In this paper, we present a decision tree based image semantic learning method, which avoids the difficult image feature discretization problem by making use of semantic template (ST) defined for each concept in our database. A ST is the representative feature of a concept, generated from the low-level features of a collection of …