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

Computer Engineering Commons

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

Articles 1 - 14 of 14

Full-Text Articles in Computer Engineering

Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg Apr 2019

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.


Effects Of Anthropomorphism On Trust In Human-Robot Interaction, Keith R. Macarthur, William T. Shugars, Tracy L. Sanders, Peter A. Hancock Aug 2017

Effects Of Anthropomorphism On Trust In Human-Robot Interaction, Keith R. Macarthur, William T. Shugars, Tracy L. Sanders, Peter A. Hancock

Keith Reid MacArthur

Robots are being integrated into everyday use, making the evaluation of trust in human-robot interactions (HRI) important to ensure their acceptance and correct usage (Lee & See, 2004; Parasuraman & Riley, 1997). Goetz, Kiesler, and Powers (2003) found that participants preferred robots with an anthropomorphic appearance appropriate for the social context of the task. This preference for robots with human-like appearance may be indicative of increased levels of trust and therefore, the present research evaluates the effects of anthropomorphism on trust.
Eighteen participants (Mage = 34.22, SDage = 10.55, n = 8 male, n =10 female) with …


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 Nov 2016

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

The present study investigated the effect of malfunctions on trust in a human-robot interaction scenario. Participants were exposed to either a planned or unplanned robot malfunction and then completed two different self-report trust measures. Resulting trust between planned and unplanned exposures was analyzed, showing that trust levels impacted by planned malfunctions did not significantly differ from those impacted by unplanned malfunctions. Therefore, it can be surmised that the methods used for the manipulation of the planned malfunctions were effective and are recommended for further study use.


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 Mar 2016

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

When considering in-group vs. out-group concepts, certain degrees of human relationships naturally assume one of two categories. Roles such as immediate and extended family members and friends tend to fit quite nicely in the in-group category. Strangers, hired help, as well as acquaintances would likely be members of the out-group category due to a lack of personal relation to the perceiver. Though an out-group member may possess cultural, socioeconomic, or religious traits that an individual may perceive as in-group, the fact that they are an unknown stranger should immediately place them in the out-group. From [K1] this notion, it can be inferred …


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 Jun 2015

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

For unmanned aerial systems (UAS) to be successfully deployed and integrated within the national airspace, it is imperative that they possess the capability to effectively complete their missions without compromising the safety of other aircraft, as well as persons and property on the ground. This necessity creates a natural requirement for UAS that can respond to uncertain environmental conditions and emergent failures in real-time, with robustness and resilience close enough to those of manned systems. We introduce a system that meets this requirement with the design of a real-time onboard system health management (SHM) capability to continuously monitor sensors, software, …


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 Mar 2014

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 Mar 2014

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 …


Optimizing Parallel Belief Propagation In Junction Trees Using Regression, Lu Zheng, Ole J. Mengshoel Jul 2013

Optimizing Parallel Belief Propagation In Junction Trees Using Regression, Lu Zheng, Ole J. Mengshoel

Ole J Mengshoel

The junction tree approach, with applications in artificial intelligence, computer vision, machine learning, and statistics, is often used for computing posterior distributions in probabilistic graphical models. One of the key challenges associated with junction trees is computational, and several parallel computing technologies - including many-core processors - have been investigated to meet this challenge. Many-core processors (including GPUs) are now programmable, unfortunately their complexities make it hard to manually tune their parameters in order to optimize software performance. In this paper, we investigate a machine learning approach to minimize the execution time of parallel junction tree algorithms implemented on a …


Exploring Multiple Dimensions Of Parallelism In Junction Tree Message Passing, Lu Zheng, Ole J. Mengshoel Jun 2013

Exploring Multiple Dimensions Of Parallelism In Junction Tree Message Passing, Lu Zheng, Ole J. Mengshoel

Ole J Mengshoel

Belief propagation over junction trees is known to be computationally challenging in the general case. One way of addressing this computational challenge is to use node-level parallel computing, and parallelize the computation associated with each separator potential table cell. However, this approach is not efficient for junction trees that mainly contain small separators. In this paper, we analyze this problem, and address it by studying a new dimension of node-level parallelism, namely arithmetic parallelism. In addition, on the graph level, we use a clique merging technique to further adapt junction trees to parallel computing platforms. We apply our parallel approach …


Mobile Computing: Challenges And Opportunities For Autonomy And Feedback, Ole J. Mengshoel, Bob Iannucci, Abe Ishihara May 2013

Mobile Computing: Challenges And Opportunities For Autonomy And Feedback, Ole J. Mengshoel, Bob Iannucci, Abe Ishihara

Ole J Mengshoel

Mobile devices have evolved to become computing platforms more similar to desktops and workstations than the cell phones and handsets of yesteryear. Unfortunately, today’s mobile infrastructures are mirrors of the wired past. Devices, apps, and networks impact one another, but a systematic approach for allowing them to cooperate is currently missing. We propose an approach that seeks to open key interfaces and to apply feedback and autonomic computing to improve both user experience and mobile system dynamics.


Spatial Computing In An Orbital Environment: An Exploration Of The Unique Constraints Of This Special Case To Other Spatial Computing Environments, Jeremy Straub May 2013

Spatial Computing In An Orbital Environment: An Exploration Of The Unique Constraints Of This Special Case To Other Spatial Computing Environments, Jeremy Straub

Jeremy Straub

The creation of an orbital services model (where spacecraft expose their capabilities for use by other spacecraft as part of a service-for-hire or barter system) requires effective determination of how to best transmit information between the two collaborating spacecraft. Existing approaches developed for ad hoc networking (e.g., wireless networks with users entering and departing in a pseudo-random fashion) exist; however, these fail to generate optimal solutions as they ignore a critical piece of available information. This additional piece of information is the orbital characteristics of the spacecraft. A spacecraft’s orbit is nearly deterministic if the magnitude and direction of its …


Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas Mar 2012

Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas

George J. Pappas

We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …


Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas Mar 2012

Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas

George J. Pappas

We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …


Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas Mar 2012

Adaptive Algorithms For Coverage Control And Space Partitioning In Mobile Robotic Networks, Jerome Le Ny, George J. Pappas

George J. Pappas

We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. Moreover, we assume that the event distribution is a priori unknown, and can only be progressively inferred from the observation of the location of the actual event occurrences. For each problem we present distributed stochastic gradient algorithms that optimize the performance objective. The stochastic …