Europe
Two Algorithms for the Movements of Robotic Bodyguard Teams
Bhatia, Taranjeet Singh (University of Central Florida) | Solmaz, Gurkan (University of Central Florida) | Turgut, Damla (University of Central Florida) | Boloni, Ladislau (University of Central Florida)
In this paper we consider a scenario where one or more robotic bodyguards are protecting an important individual (VIP) moving in a public space against harassment or harm from unarmed civilians. In this scenario, the main objective of the robots is to position themselves such that at any given moment they provide maximum physical cover for the VIP. The robots need to follow the VIP in its movement and take into account the movements of the civilians as well. The environment can also contain obstacles which present challenges to movement but also provide natural cover. We designed two algorithms for the movement of the bodyguard robots: Threat Vector Resolution (TVR) for a single robot and Quadrant Load Balancing (QLB) for teams of bodyguard robots. We evaluated the proposed approaches against rigid formations in a simulation study.
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent
Brown, Noam (Carnegie Mellon University) | Ganzfried, Sam (Carnegie Mellon University) | Sandholm, Tuomas (Carnegie Mellon University)
The leading approach for solving large imperfect-information games is automated abstraction followed by running an equilibrium-finding algorithm. We introduce a distributed version of the most commonly used equilibrium-finding algorithm, counterfactual regret minimization (CFR), which enables CFR to scale to dramatically larger abstractions and numbers of cores. The new algorithm begets constraints on the abstraction so as to make the pieces running on different computers disjoint. We introduce an algorithm for generating such abstractions while capitalizing on state-of-the-art abstraction ideas such as imperfect recall and earth-mover's distance. Our techniques enabled an equilibrium computation of unprecedented size on a supercomputer with a high inter-blade memory latency. Prior approaches run slowly on this architecture. Our approach also leads to a significant improvement over using the prior best approach on a large shared-memory server with low memory latency. Finally, we introduce a family of post-processing techniques that outperform prior ones. We applied these techniques to generate an agent for two-player no-limit Texas Hold'em that won the 2014 Annual Computer Poker Competition, beating each opponent with statistical significance.
NOTES2: Networks-of-Traces for Epidemic Spread Simulations
Liu, Sicong (Arizona State University) | Garg, Yash (Arizona State University) | Candan, K. Selcuk (Arizona State University) | Sapino, Maria Luisa (University of Torino) | Chowell-Puente, Gerardo (Arizona State University)
Decision making and intervention against infectious diseases require analysis of large volumes of data, including demographic data, contact networks, age-specific contact rates, mobility networks, and healthcare and control intervention data and models. In this paper, we present our Networks-Of-Traces for Epidemic Spread Simulations (NOTES2) model and system which aim at assisting experts and helping them explore existing simulation trace data sets. NOTES2 supports analysis and indexing of simulation data sets as well as parameter and feature analysis, including identification of unknown dependencies across the input parameters and output variables spanning the different layers of the observation and simulation data.
Game Theoretic Considerations for Optimizing Efficiency of Taxi Systems
Gan, Jiarui (Institute of Computing Technology Chinese Academy of Science) | An, Bo (Nanyang Technological University)
Taxi service is an indispensable part of public transport in modern cities. The taxi system is operated by a large number of self-controlled drivers lacking of centralized scheduling and control, which makes it inefficient, difficult to analyze and optimize. It is thus important to take into account taxi drivers' strategic behavior in order to optimize taxi systems' efficiency. This paper reviews existing taxi system researches for modeling taxi system dynamics, introduces the taxi system efficiency optimization problem, and presents a game theoretic approach for optimizing the efficiency of taxi systems. Challenges and open issues in the taxi system efficiency optimization problem are also discussed.
Concept of a Data Thread Based Parking Space Occupancy Prediction in a Berlin Pilot Region
Tiedemann, Tim (German Research Center for Artificial Intelligence (DFKI)) | Voegele, Thomas (German Research Center for Artificial Intelligence (DFKI)) | Krell, Mario Michael (University of Bremen) | Metzen, Jan Hendrik (University of Bremen) | Kirchner, Frank (German Research Center for Artificial Intelligence (DFKI) and University of Bremen)
In the presented research project, a software and hardware infrastructure for parking space focussed inter-modal route planning in a public pilot region in Berlin is developed. One central topic is the development of a prediction system which gives an estimated occupancy for the parking spaces in the pilot region for a given date and time in the future. Occupancy data will be collected online by roadside parking sensors developed within the project. The occupancy prediction will be implemented using “Neural Gas” machine learning in combination with a proposed method which uses data threads to improve the prediction quality. In this paper, a short overview of the whole research project is given. Furthermore, the concept of the software framework and the learning methods are presented and first collected data is shown. The prediction method using data threads is explained in more detail.
Optimizing Rotorcraft Approach Trajectories with Acoustic and Land Use Models
Morris, Robert (NASA Ames Research Center) | Venable, K. Brent (Tulane University / IHMC) | Johnson, Matthew (IHMC)
Recent increase in interest in using rotorcraft (helicopters and tilt-rotor craft) for public transportation has spurred research in making rotorcraft less noisy, particularly as they land. The ground noise associated with landing trajectories followed by rotorcraft depends in part on the changes in altitude and velocity of the rotorcraft during flight. Acoustic models of ground noise taking altitude and velocity effects into account can be used in an optimization process to determine a set of potentially quieter pilot operations. However, optimizing solely for acoustic properties produces patterns that abstract away from the environment in which the trajectory is flown. A quiet procedure flown over a residential area can create considerable annoyance. To overcome this limitation of acoustic-based optimization we propose a hybrid cost model for optimization that combines acoustic criteria with a land use model that views noise-sensitive areas around landing facilities as weighted obstacles. The result is a 3D route planning problem with obstacles. We introduce a system, called NORA (Noise Optimization for Rotorcraft Approach) that allows for the computation of trajectories that simultaneously solve for acoustically quiet patterns that also avoid land sensitive areas.
Living Campus: Towards a Context-Aware Energy Efficient Campus Using Weighted Case Based Reasoning
Madkour, Mohcine (University of Houston) | Benhaddou, Driss (University of Houston) | Khalil, Nacer (University of Houston) | Burriello, Michael (University of Houston) | Raymond E. Cline, Jr. (University of Houston)
Buildings make a city’s landscape and are home to its people. The demand for smart buildings and housing is growing by the need for cities to make their buildings more efficient, green and livable. This emergent intelligence is underpinned by the use of Information and Communications Technology (ICT) linked by Pervasive Sensing and real-time data analytics. In a typical growth of smart buildings, Smart Campuses are going to be amazing community hubs which will be more sustainable, efficient and supportive of its inhabitants. In this regard, huge amount of useful and real-time generated data are being analyzed to help people and machines infer instant decisions in relation to energy efficiency. However, because of different terminologies used by different players, structural, representational and semantic heterogeneity constrain the interoperability between applications and misleads to adaptive and context-aware control behavior. In this paper, the focus is to alleviate the current problem by designing a semantic framework that represents the smart campus data and activities in an ontological model. Also, the framework is deepened by an Artificial Intelligent (AI) method using Weighted Case Based Reasoning (WCBR) for enabling context awareness. An illustration will be the elaboration of an adaptive and autonomous control of HVAC (Heating Ventilation and Air Conditioning) system, in this example the WCBR is discussed and case representation, case adaptation, and similarity computation are sketched in detail.
Friendly Artificial Intelligence: The Physics Challenge
Tegmark, Max (Massachusetts Institute of Technology)
Relentless progress in artificial intelligence (AI) is increasingly raising concerns that machines will replace humans on the job market, and perhaps altogether. Eliezer Yudkowski and others have explored the possibility that a promising future for humankind could be guaranteed by a superintelligent "Friendly AI" , designed to safeguard humanity and its values. I will argue that, from a physics perspective where everything is simply an arrangement of elementary particles, this might be even harder than it appears. Indeed, it may require thinking rigorously about the meaning of life: What is "meaning" in a particle arrangement? What is "life"? What is the ultimate ethical imperative, i.e., how should we strive to rearrange the particles of our Universe and shape its future? If we fail to answer the last question rigorously, this future is unlikely to contain humans.
On Keeping Secrets: Intelligent Agents and the Ethics of Information Hiding
Hunter, Aaron (British Columbia Institute of Technology)
Communication involves transferring information from one agent to another. An intelligent agent, either human or machine, is often able to choose to hide information in order to protect their interests. The notion of information hiding is closely linked to secrecy and dishonesty, but it also plays an important role in domains such as software engineering. In this paper, we consider the ethics of information hiding, particularly with respect to intelligent agents. In other words, we are concerned with situations that involve a human and an intelligent agent with access to different information. Is the intelligent agent justified in preventing a human user from accessing the information that they possess? This is trivially true in the case where access control systems exist. However, we are concerned with the situation where an intelligent agent is able to using a reasoning system to decide not to share information with all humans. On the other hand, we are also concerned with situations where humans hide information from machines. Are we ever under a moral obligation to share information with a computional agent? We argue that questions of this form are increasingly important now, as people are increasingly willing to divulge private information to machines with a great capacity to reason with that information and share it with others.
Toward Ensuring Ethical Behavior from Autonomous Systems: A Case-Supported Principle-Based Paradigm
Anderson, Michael (University of Hartford) | Anderson, Susan Leigh (University of Connecticut)
A paradigm of case-supported principle-based behavior (CPB) is proposed to help ensure ethical behavior of autonomous machines. We argue that ethically significant behavior of autonomous systems should be guided by explicit ethical principles determined through a consensus of ethicists. Such a consensus is likely to emerge in many areas in which autonomous systems are apt to be deployed and for the actions they are liable to undertake, as we are more likely to agree on how machines ought to treat us than on how human beings ought to treat one another. Given such a consensus, particular cases of ethical dilemmas where ethicists agree on the ethically relevant features and the right course of action can be used to help discover principles needed for ethical guidance of the behavior of autonomous systems. Such principles help ensure the ethical behavior of complex and dynamic systems and further serve as a basis for justification of their actions as well as a control abstraction for managing unanticipated behavior. The requirements, methods, implementation, and evaluation components of the CPB paradigm are detailed.