Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Bayesian Networks (7)
- Bayesian networks (5)
- Uncertainty (5)
- Parallel Computing (4)
- Robotics (4)
-
- Adaptive algorithms (3)
- Aerospace (3)
- Arithmetic Circuits (3)
- Artificial Intelligence & Robotic Control (3)
- Auction (3)
- Coverage control problems (3)
- Diagnosis (3)
- Dynamic vehicle routing problems (3)
- HRI (3)
- Market-based resource allocation (3)
- Partitioning algorithms (3)
- Robustness (3)
- Scheduling (3)
- Small Spacecraft (3)
- Software Engineering (3)
- Stochastic gradient algorithms (3)
- Verification and Validation (3)
- Belief propagation (2)
- Evolutionary Computation (2)
- Fault detection (2)
- Feedback Control (2)
- GPUs (2)
- Genetic algorithms (2)
- Junction Trees (2)
- Junction trees (2)
- Publication
- File Type
Articles 1 - 30 of 49
Full-Text Articles in Engineering
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg
George K. Thiruvathukal
This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.
Prediction Of Solid Oxide Fuel Cell Performance Using Artificial Neural Network, M. A. Rafe Biswas, Kamwana N. Mwara
Prediction Of Solid Oxide Fuel Cell Performance Using Artificial Neural Network, M. A. Rafe Biswas, Kamwana N. Mwara
M. A. Rafe Biswas
Effects Of Anthropomorphism On Trust In Human-Robot Interaction, Keith R. Macarthur, William T. Shugars, Tracy L. Sanders, Peter A. Hancock
Effects Of Anthropomorphism On Trust In Human-Robot Interaction, Keith R. Macarthur, William T. Shugars, Tracy L. Sanders, Peter A. Hancock
Keith Reid MacArthur
Perceptions Of Planned Versus Unplanned Malfunctions: A Human-Robot Interaction Scenario, Theresa T. Kessler, Keith R. Macarthur, Manuel Trujillo-Silva, Thomas Macgillivray, Chris Ripa, Peter A. Hancock
Perceptions Of Planned Versus Unplanned Malfunctions: A Human-Robot Interaction Scenario, Theresa T. Kessler, Keith R. Macarthur, Manuel Trujillo-Silva, Thomas Macgillivray, Chris Ripa, Peter A. Hancock
Keith Reid MacArthur
Gaussian Nonlinear Line Attractor For Learning Multidimensional Data, Theus H. Aspiras, Vijayan K. Asari, Wesam Sakla
Gaussian Nonlinear Line Attractor For Learning Multidimensional Data, Theus H. Aspiras, Vijayan K. Asari, Wesam Sakla
Vijayan K. Asari
The human brain’s ability to extract information from multidimensional data modeled by the Nonlinear Line Attractor (NLA), where nodes are connected by polynomial weight sets. Neuron connections in this architecture assumes complete connectivity with all other neurons, thus creating a huge web of connections. We envision that each neuron should be connected to a group of surrounding neurons with weighted connection strengths that reduces with proximity to the neuron. To develop the weighted NLA architecture, we use a Gaussian weighting strategy to model the proximity, which will also reduce the computation times significantly. Once all data has been trained in …
Brain Machine Interface Using Emotiv Epoc To Control Robai Cyton Robotic Arm, Daniel P. Prince, Mark J. Edmonds, Andrew J. Sutter, Matthew Thomas Cusumano, Wenjie Lu, Vijayan K. Asari
Brain Machine Interface Using Emotiv Epoc To Control Robai Cyton Robotic Arm, Daniel P. Prince, Mark J. Edmonds, Andrew J. Sutter, Matthew Thomas Cusumano, Wenjie Lu, Vijayan K. Asari
Vijayan K. Asari
The initial framework for an electroencephalography (EEG) thought recognition software suite is developed, built, and tested. This suite is designed to recognize human thoughts and pair them to actions for controlling a robotic arm. Raw EEG brain activity data is collected using an Emotiv EPOC headset. The EEG data is processed through linear discriminant analysis (LDA), where an intended action is identified. The EEG classification suite is being developed to increase the number of distinct actions that can be identified compared to the Emotiv recognition software. The EEG classifier was able to correctly distinguish between two separate physical movements. Future …
Human-Robot Versus Human-Human Relationship Impact On Comfort Levels Regarding In Home Privacy, Keith R. Macarthur, Thomas G. Macgillivray, Eva L. Parkhurst, Peter A. Hancock
Human-Robot Versus Human-Human Relationship Impact On Comfort Levels Regarding In Home Privacy, Keith R. Macarthur, Thomas G. Macgillivray, Eva L. Parkhurst, Peter A. Hancock
Keith Reid MacArthur
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Shih-Fen Cheng
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 on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Shih-Fen Cheng
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 on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau
Shih-Fen CHENG
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 on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …
Towards Real-Time, On-Board, Hardware-Supported Sensor And Software Health Management For Unmanned Aerial Systems, Johann M. Schumann, Kristin Y. Rozier, Thomas Reinbacher, Ole J. Mengshoel, Timmy Mbaya, Corey Ippolito
Towards Real-Time, On-Board, Hardware-Supported Sensor And Software Health Management For Unmanned Aerial Systems, Johann M. Schumann, Kristin Y. Rozier, Thomas Reinbacher, Ole J. Mengshoel, Timmy Mbaya, Corey Ippolito
Ole J Mengshoel
Feedback Control For Multi-Modal Optimization Using Genetic Algorithms, Jun Shi, Ole J. Mengshoel, Dipan K. Pal
Feedback Control For Multi-Modal Optimization Using Genetic Algorithms, Jun Shi, Ole J. Mengshoel, Dipan K. Pal
Ole J Mengshoel
Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Kyriakos MOURATIDIS
In this paper we study a novel query type, called direct neighbor query. Two objects in a dataset are direct neighbors (DNs) if a window selection may exclusively retrieve these two objects. Given a source object, a DN search computes all of its direct neighbors in the dataset. The DNs define a new type of affinity that differs from existing formulations (e.g., nearest neighbors, nearest surrounders, reverse nearest neighbors, etc.) and finds application in domains where user interests are expressed in the form of windows, i.e., multi-attribute range selections. Drawing on key properties of the DN relationship, we develop an …
Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau
Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau
Shih-Fen CHENG
Congestion occurs when there is competition for resources by sel sh agents. In this paper, we are concerned with smoothing out congestion in a network of resources by using personalized well-timed in- centives that are subject to budget constraints. To that end, we provide: (i) a mathematical formulation that computes equilibrium for the re- source sharing congestion game with incentives and budget constraints; (ii) an integrated approach that scales to larger problems by exploiting the factored network structure and approximating the attained equilib- rium; (iii) an iterative best response algorithm for solving the uncon- strained version (no budget) of the …
Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau
Multi-Agent Orienteering Problem With Time-Dependent Capacity Constraints, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau
Shih-Fen CHENG
The Orienteering Problem (OP), as originally defined by Tsiligirides, is the problem of cross-countr sport in which participants get rewards from visiting a predefined set of checkpoints. As Orienteering Problem can be used to describe a wide variety of real-world problems like route planning for facility inspection, patrolling of strategic location, and reward-weighted traveling salesman problem, it has attracted continuous interests from researchers and a large number of variants and corresponding algorithms for solving them have been introduced.
A Multi-Objective Memetic Algorithm For Vehicle Resource Allocation In Sustainable Transportation Planning, Hoong Chuin Lau, Lucas Agussurja, Shih-Fen Cheng, Pang Jin Tan
A Multi-Objective Memetic Algorithm For Vehicle Resource Allocation In Sustainable Transportation Planning, Hoong Chuin Lau, Lucas Agussurja, Shih-Fen Cheng, Pang Jin Tan
Shih-Fen CHENG
Sustainable supply chain management has been an increasingly important topic of research in recent years. At the strategic level, there are computational models which study supply and distribution networks with environmental considerations. At the operational level, there are, for example, routing and scheduling models which are constrained by carbon emissions. Our paper explores work in tactical planning with regards to vehicle resource allocation from distribution centers to customer locations in a multi-echelon logistics network. We formulate the bi-objective optimization problem exactly and design a memetic algorithm to efficiently derive an approximate Pareto front. We illustrate the applicability of our approach …
An Agent-Based Simulation Approach To Experience Management In Theme Parks, Shih-Fen Cheng, Larry Junjie Lin, Jiali Du, Hoong Chuin Lau, Pradeep Reddy Varakantham
An Agent-Based Simulation Approach To Experience Management In Theme Parks, Shih-Fen Cheng, Larry Junjie Lin, Jiali Du, Hoong Chuin Lau, Pradeep Reddy Varakantham
Shih-Fen CHENG
In this paper, we illustrate how massive agent-based simulation can be used to investigate an exciting new application domain of experience management in theme parks, which covers topics like congestion control, incentive design, and revenue management. Since all visitors are heterogeneous and self-interested, we argue that a high-quality agent-based simulation is necessary for studying various problems related to experience management. As in most agent-base simulations, a sound understanding of micro-level behaviors is essential to construct high-quality models. To achieve this, we designed and conducted a first-of-its-kind real-world experiment that helps us understand how typical visitors behave in a theme-park environment. …
Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng
Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng
Shih-Fen CHENG
In many real-life businesses, the service provider/seller keeps a log of the visitors’ behavior as a way to assess the efficiency of the current business/operation model and find room for improvement. For example, by tracking when visitors entering attractions in a theme park, theme park owners can detect when and where congestion may occur, thus having contingency plans to reroute the visitors accordingly. Similarly, a Cable TV service provider can track channel switching events at each household to identify uninteresting channels. Subsequently, the repertoire of channels up for subscription can evolve over time to better serve the entertainment demand of …
The Use Of The Blackboard Architecture For A Decision Making System For The Control Of Craft With Various Actuator And Movement Capabilities, Jeremy Straub, Hassan Reza
The Use Of The Blackboard Architecture For A Decision Making System For The Control Of Craft With Various Actuator And Movement Capabilities, Jeremy Straub, Hassan Reza
Jeremy Straub
This paper provides an overview of an approach to the control of multiple craft with heterogeneous movement and actuation characteristics that is based on the Blackboard software architecture. An overview of the Blackboard architecture is provided. Then, the operational and mission requirements that dictate the need for autonomous control are characterized and the utility of the Blackboard architecture is for meeting these requirements is discussed. The performance of a best-path solver and naïve solver are compared. The results demonstrate that the best-path solver outperforms the naïve solver in the amount of time taken to generate a solution; however, the number …
Openorbiter Operating Software, Dayln Limesand, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Openorbiter Operating Software, Dayln Limesand, Christoffer Korvald, Jeremy Straub, Ronald Marsh
Jeremy Straub
The operating software team of the OpenOrbiter project has been tasked with developing software for general spacecraft maintenance, performing mission tasks and the monitoring of system critical aspects of the spacecraft. To do so, the team is developing an autonomous system that will be able to continuously check sensors for data, and schedule tasks that pertain to the current mission and general maintenance of the onboard systems. Development in support of these objectives is ongoing with work focusing on the completion of the development of a stable system. This poster will present an overview of current work on the project …
The Design Of The Open Prototype For Educational Nanosats, Jeremy Straub
The Design Of The Open Prototype For Educational Nanosats, Jeremy Straub
Jeremy Straub
No abstract provided.
Towards Real-Time, On-Board, Hardware-Supported Sensor And Software Health Management For Unmanned Aerial Systems, Johann Schumann, Kristin Y. Rozier, Thomas Reinbacher, Ole J. Mengshoel, Timmy Mbaya, Corey Ippolito
Towards Real-Time, On-Board, Hardware-Supported Sensor And Software Health Management For Unmanned Aerial Systems, Johann Schumann, Kristin Y. Rozier, Thomas Reinbacher, Ole J. Mengshoel, Timmy Mbaya, Corey Ippolito
Ole J Mengshoel
Optimizing Parallel Belief Propagation In Junction Trees Using Regression, Lu Zheng, Ole J. Mengshoel
Optimizing Parallel Belief Propagation In Junction Trees Using Regression, Lu Zheng, Ole J. Mengshoel
Ole J Mengshoel
Exploring Multiple Dimensions Of Parallelism In Junction Tree Message Passing, Lu Zheng, Ole J. Mengshoel
Exploring Multiple Dimensions Of Parallelism In Junction Tree Message Passing, Lu Zheng, Ole J. Mengshoel
Ole J Mengshoel
Mobile Computing: Challenges And Opportunities For Autonomy And Feedback, Ole J. Mengshoel, Bob Iannucci, Abe Ishihara
Mobile Computing: Challenges And Opportunities For Autonomy And Feedback, Ole J. Mengshoel, Bob Iannucci, Abe Ishihara
Ole J Mengshoel
Software Health Management With Bayesian Networks, Johann Schumann, Timmy Mbaya, Ole J. Mengshoel, Knot Pipatsrisawat, Ashok Srivastava, Arthur Choi, Adnan Darwiche
Software Health Management With Bayesian Networks, Johann Schumann, Timmy Mbaya, Ole J. Mengshoel, Knot Pipatsrisawat, Ashok Srivastava, Arthur Choi, Adnan Darwiche
Ole J Mengshoel
Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng
Uncertain Congestion Games With Assorted Human Agent Populations, Asrar Ahmed, Pradeep Reddy Varakantham, Shih-Fen Cheng
Shih-Fen CHENG
Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, movement of taxis can be involuntary or nondeterministic (decided by the specific …
Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen
Decentralized Decision Support For An Agent Population In Dynamic And Uncertain Domains, Pradeep Reddy Varakantham, Shih-Fen Cheng, Thi Duong Nguyen
Shih-Fen CHENG
This research is motivated by problems in urban transportation and labor mobility, where the agent flow is dynamic, non-deterministic and on a large scale. In such domains, even though the individual agents do not have an identity of their own and do not explicitly impact other agents, they have implicit interactions with other agents. While there has been much research in handling such implicit effects, it has primarily assumed controlled movements of agents in static environments. We address the issue of decision support for individual agents having involuntary movements in dynamic environments . For instance, in a taxi fleet serving …
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng
Shih-Fen Cheng
Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Reddy Varakantham, William Yeoh, Ajay Srinivasan, Hoong Chuin Lau, Shih-Fen Cheng
Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Reddy Varakantham, William Yeoh, Ajay Srinivasan, Hoong Chuin Lau, Shih-Fen Cheng
Shih-Fen CHENG
Multi-agent planning is a well-studied problem with applications in various areas. Due to computational constraints, existing research typically focuses either on unstructured domains with many agents, where we are content with heuristic solutions, or domains with small numbers of agents or special structure, where we can find provably near-optimal solutions. In contrast, here we focus on provably near-optimal solutions in domains with many agents, by exploiting influence limits. To that end, we make two key contributions: (a) an algorithm, based on Lagrangian relaxation and randomized rounding, for solving multi-agent planning problems represented as large mixed-integer programs; (b) a proof of …