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

Computer Sciences Commons™

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

AI

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 301 - 309 of 309

Full-Text Articles in Computer Sciences

Machines And The Moral Community, Erica L. Neely Jun 2013

Machines And The Moral Community, Erica L. Neely

Philosophy and Religion Faculty Scholarship

A key distinction in ethics is between members and nonmembers of the moral community. Over time, our notion of this community has expanded as we have moved from a rationality criterion to a sentience criterion for membership. I argue that a sentience criterion is insufficient to accommodate all members of the moral community; the true underlying criterion can be understood in terms of whether a being has interests. This may be extended to conscious, self-aware machines, as well as to any autonomous intelligent machines. Such machines exhibit an ability to formulate desires for the course of their own existence; this …


Practical Tractability Of Csps By Higher Level Consistency And Tree Decomposition, Shant Karakashian May 2013

Practical Tractability Of Csps By Higher Level Consistency And Tree Decomposition, Shant Karakashian

School of Computing: Dissertations, Theses, and Student Research

Constraint Satisfaction is a flexible paradigm for modeling many decision problems in Engineering, Computer Science, and Management. Constraint Satisfaction Problems (CSPs) are in general NP-complete and are usually solved with search. Research has identified various islands of tractability, which enable solving certain CSPs with backtrack-free search. For example, one sufficient condition for tractability relates the consistency level of a CSP to treewidth of the CSP's constraint network. However, enforcing higher levels of consistency on a CSP may require the addition of constraints, thus altering the topology of the constraint network and increasing its treewidth. This thesis addresses the following question: …


Using Ant Colonization Optimization To Control Difficulty In Video Game Ai., Joshua Courtney May 2010

Using Ant Colonization Optimization To Control Difficulty In Video Game Ai., Joshua Courtney

Undergraduate Honors Theses

Ant colony optimization (ACO) is an algorithm which simulates ant foraging behavior. When ants search for food they leave pheromone trails to tell other ants which paths to take to find food. ACO has been adapted to many different problems in computer science: mainly variations on shortest path algorithms for graphs and networks.

ACO can be adapted to work as a form of communication between separate agents in a video game AI. By controlling the effectiveness of this communication, the difficulty of the game should be able to be controlled. Experimentation has shown that ACO works effectively as a form …


Beyond Home Automation: Designing More Effective Smart Home Systems, Paolo Carner Oct 2009

Beyond Home Automation: Designing More Effective Smart Home Systems, Paolo Carner

9th. IT & T Conference

This paper outlines a Smart Home Proof-of-Concept system that uses a Bayesian Network to predict the likelihood of a monitored event to occur. Firstly, this paper will provide an introduction to the concept of a smart home system; then it will outline how Artificial Intelligence concepts can be used to make such systems more effective. Finally, it will detail the implementation of a smart home system, which uses an inference engine to determine the likelihood of a fire. The system prototype has implemented using a LonWorks™ hardware kit and a Netica™ Bayesian Network engine from Norsys.


Energetic Path Finding Across Massive Terrain Data, Andrew N. Tsui Jun 2009

Energetic Path Finding Across Massive Terrain Data, Andrew N. Tsui

Master's Theses

Before there were airplanes, cars, trains, boats, or bicycles, the primary means of transportation was on foot. Unfortunately, many of the trails used by ancient travelers have long since been abandoned. We present a software tool which can help visualize and predict where these forgotten trails might lie through the use of a human-centered cost metric. By comparing the paths generated by our software with known historical trails, we demonstrate how the tool can indicate likely trails used by ancient travelers. In addition, this new tool provides novel visualizations to better help the user understand alternate paths, effect of terrain, …


Simulation And Visualization Of Environments With Multidimensional Time, Luther A. Tychonievich Jan 2008

Simulation And Visualization Of Environments With Multidimensional Time, Luther A. Tychonievich

Theses and Dissertations

This work introduces the notion of computational hypertime, or the simulation and visualization of hypothetical environments possessing multidimensional time. An overview of hypertime is provided,including an intuitive visualization paradigm and a discussion of the failure of common simulation techniques when extended to include multidimensional time. A condition for differential equations describing hypertime motion to be amenable to standard time-iterative simulation techniques is provided,but is not satisfied by any known model of physics. An alternate simulation algorithm involving iterative refinement of entire equations of motion is presented,with an example implementation to solve elastic collisions in hypertime. An artificial intelligence algorithm for …


Self-Adjusting Finite State Machines: An Approach To Real-Time Autonomous Behavior In Robots, Scott Schwartz Aug 2005

Self-Adjusting Finite State Machines: An Approach To Real-Time Autonomous Behavior In Robots, Scott Schwartz

Computer Science Honors Theses

In the Robotics industry, it is a frequent requirement that robots operate in real-time. The usual approach to this issue involves creating robots driven entirely by direct environmental input rather than complicated planning and decision-making AI. This approach means that the current state of the robot in relation to its environment exclusively determines the actions of the robot. In the simplest terms, this approach creates a Finite State Machine (FSM). Clearly, a standard FSM is completely pre-deterministic upon its creation. This is a drawback which immediately disallows the robot to cope with dynamic environments in an autonomous manner. This research …


Koala: An Object-Agent Design System, Kym J. Pohl, Jens G. Pohl Aug 1996

Koala: An Object-Agent Design System, Kym J. Pohl, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

This paper describes KOALA, a design system with primary focus on the predesign stage of architectural design. KOALA combines object-agent technology with high level representation to form a partnership between the human designer and the computer-based design environment. A diverse taxonomy of agents including Domain agents. Space agents, and Monitor agents work in a collaborative fashion to provide the human designer with expert evaluation and assistance in developing a design solution. Spaces, in their roles as agents attempt to formulate various design solutions based on individual perspectives through negotiation with other agents. The result is a highly interactive design environment …


A Philosophical Critique Of Artificial Intelligence, David Miller Apr 1990

A Philosophical Critique Of Artificial Intelligence, David Miller

Mahurin Honors College Capstone Experience/Thesis Projects

The term "Artificial Intelligence" creates fantastic images of robots and omniscient machines. Of all the technological pursuits, Artificial Intelligence best epitomizes man's thirst for technology. The science of making machines think stands at the apex of man's mission, reflecting not only his desire for control over his world but also his quest to control himself. To create a machine capable of thought -- rational life -- would mean that man would have achieved a dream as old as technology itself.