IPSV
A Real-Time Decision Support System for High Cost Oil-Well Drilling Operations
Gundersen, Odd Erik (http://www.verdandetechnology.com) | Sørmo, Frode (Verdande Technology) | Aamodt, Agnar (Norwegian Unversity of Science and Technology) | Skalle, Pål (Norwegian University of Science and Technology)
In this article we present DrillEdge -- a commercial and award winning software system that monitors oil-well drilling operations in order to reduce non-productive time (NPT). DrillEdge utilizes case-based reasoning with temporal representations on streaming real-time data, pattern matching and agent systems to predict problems and give advice on how to mitigate the problems. The methods utilized, the architecture, the GUI and development cost in addition to two case studies are documented.
TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems Using Game Theory
Yin, Zhengyu (University of Southern California) | Jiang, Albert Xin (University of Southern California) | Tambe, Milind (University of Southern California) | Kiekintveld, Christopher (University of Texas at El Paso) | Leyton-Brown, Kevin (University of British Columbia) | Sandholm, Tuomas (Carnegie Mellon University) | Sullivan, John P. (Los Angeles County Sheriff's Department)
In proof-of-payment transit systems, passengers are legally required to purchase tickets before entering but are not physically forced to do so. Instead, patrol units move about the transit system, inspecting the tickets of passengers, who face fines if caught fare evading. TRUSTS models the problem of computing patrol strategies as a leader-follower Stackelberg game where the objective is to deter fare evasion and hence maximize revenue. We present an efficient algorithm for computing such patrol strategies and present experimental results using real-world ridership data from the Los Angeles Metro Rail system.
Reports of the AAAI 2012 Conference Workshops
Agrawal, Vikas (Infosys Limited) | Baier, Jorge (Pontificia Universidad Católica de Chile) | Bekris, Kostas (Rutgers University) | Chen, Yiling (Harvard University) | Garcez, Artur S. d'Avila (City University London,) | Hitzler, Pascal (Wright State University) | Haslum, Patrik (Australian National University) | Jannach, Dietmar (TU Dortmund) | Law, Edith (Carnegie Mellon University) | Lecue, Freddy (IBM Research) | Lamb, Luis C. (Federal University of Rio Grande do Sul) | Matuszek, Cynthia (University of Washington) | Palacios, Hector (Universidad Carlos III de Madrid) | Srivastava, Biplav (IBM Research) | Shastri, Lokendra (Infosys Limited) | Sturtevant, Nathan (University of Denver) | Stern, Roni (Ben Gurion University of the Negev) | Tellex, Stefanie (Massachusetts Institute of Technology) | Vassos, Stavros (National and Kapodistrian University of Athens)
The Multi-Agent Programming Contest
Behrens, Tristan (Clausthal University of Technology) | Dastani, Mehdi (Utrecht University) | Dix, Jürgen (Clausthal University of Technology) | Hübner, Jomi (University of Santa Catarina) | Köster, Michael (Clausthal University of Technology) | Novák, Peter (Delft University of Technology) | Schlesinger, Federico (Clausthal University of Technology)
The international Multi-Agent Programming Contest (MAPC), is a community-serving effort to facilitate advances in programming multiagent systems (MAS) by (1) developing benchmark problems, (2) enabling head-to-head comparison of MAS's and (3) supporting educational efforts in the design and implementation of MAS's.
The Answer Set Programming Competition
Calimeri, Francesco (Universita') | Ianni, Giovambattista (della Calabria) | Krennwallner, Thomas (Universita') | Ricca, Francesco (della Calabria)
The Answer Set Programming (ASP) Competition is a biannual event for evaluating declarative knowledge representation systems on hard and demanding AI problems. The competition consists of two main tracks: the ASP system track and the model and solve track. The traditional system track compares dedicated answer set solvers on ASP benchmarks, while the model and solve track invites any researcher and developer of declarative knowledge representation systems to participate in an open challenge for solving sophisticated AI problems with their tools of choice. This article provides an overview of the ASP competition series, reviews its origins and history, giving insights on organizing and running such an elaborate event, and briefly discusses about the lessons learned so far.
PROTECT -- A Deployed Game Theoretic System for Strategic Security Allocation for the United States Coast Guard
An, Bo (University of Southern California) | Shieh, Eric (University of Southern California) | Tambe, Milind (University of Southern California) | Yang, Rong (University of Southern California) | Baldwin, Craig (United States Coast Guard) | DiRenzo, Joseph (United States Coast Guard) | Maule, Ben (United States Coast Guard) | Meyer, Garrett (United States Coast Guard)
While three deployed applications of game theory for security have recently been reported, we as a community of agents and AI researchers remain in the early stages of these deployments; there is a continuing need to understand the core principles for innovative security applications of game theory. PROTECT is premised on an attacker-defender Stackelberg game model and offers five key innovations. First, this system is a departure from the assumption of perfect adversary rationality noted in previous work, relying instead on a quantal response (QR) model of the adversary's behavior --- to the best of our knowledge, this is the first real-world deployment of the QR model. Fourth, our experimental results illustrate that PROTECT's QR model more robustly handles real-world uncertainties than a perfect rationality model.
Machine Learning for Personalized Medicine: Predicting Primary Myocardial Infarction from Electronic Health Records
Weiss, Jeremy C. (University of Wisconsin-Madison) | Natarajan, Sriraam (Wake Forest University) | Peissig, Peggy L. (Marshfield Clinic Research Foundation) | McCarty, Catherine A. (Essentia Institute of Rural Health) | Page, David (University of Wisconsin-Madison)
Electronic health records (EHRs) are an emerging relational domain with large potential to improve clinical outcomes. We apply two statistical relational learning (SRL) algorithms to the task of predicting primary myocardial infarction. We show that one SRL algorithm, relational functional gradient boosting, outperforms propositional learners particularly in the medically-relevant high recall region. We observe that both SRL algorithms predict outcomes better than their propositional analogs and suggest how our methods can augment current epidemiological practices.
Towards Adapting Cars to their Drivers
Rosenfeld, Avi (Jerusalem College of Technology) | Bareket, Zevi (University of Michigan) | Goldman, Claudia V. (General Motors) | Kraus, Sarit (Bar-Ilan University) | LeBlanc, David J. (University of Michigan) | Tsimhoni, Omer (General Motors)
Such interactive activity leads us to consider intelligent and advanced ways of interaction leading to cars that can adapt to their drivers.In this paper, we focus on the Adaptive Cruise Control (ACC) technology that allows a vehicle to automatically adjust its speed to maintain a preset distance from the vehicle in front of it based on the driver's preferences. We introduce a method to combine machine learning algorithms with demographic information and expert advice into existing automated assistive systems. This method can reduce the interactions between drivers and automated systems by adjusting parameters relevant to the operation of these systems based on their specific drivers and context of drive. While generic packages such as Weka were successful in learning drivers' behavior, we found that improved learning models could be developed by adding information on drivers' demographics and a previously developed model about different driver types.
Playing with Cases: Rendering Expressive Music with Case-Based Reasoning
Mántaras, Ramon López de (Spanish National Research Council (CSIC))
Following a brief overview discussing why we prefer listening to expressive music instead of lifeless synthesized music, we examine a representative selection of well-known approaches to expressive computer music performance with an emphasis on AI-related approaches. In the main part of the paper we focus on the existing CBR approaches to the problem of synthesizing expressive music, and particularly on TempoExpress, a case-based reasoning system developed at our Institute, for applying musically acceptable tempo transformations to monophonic audio recordings of musical performances. Finally we briefly describe an ongoing extension of our previous work consisting on complementing audio information with information of the gestures of the musician. Music is played through our bodies, therefore capturing the gesture of the performer is a fundamental aspect that has to be taken into account in future expressive music renderings.
Competitive Benchmarking: Lessons Learned from the Trading Agent Competition
Ketter, Wolfgang (Erasmus University) | Symeonidis, Andreas (Aristotle University of Thessaloniki)
Over the years, competitions have been important catalysts for progress in artificial intelligence. We describe the goal of the overall Trading Agent Competition and highlight particular competitions. We discuss its significance in the context of today's global market economy as well as AI research, the ways in which it breaks away from limiting assumptions made in prior work, and some of the advances it has engendered over the past ten years. Since its introduction in 2000, TAC has attracted more than 350 entries and brought together researchers from AI and beyond.