{"title":"TaxiSim: A Multiagent Simulation Platform for Evaluating Taxi Fleet Operations","authors":"Shih-Fen Cheng, Thi-Duong Nguyen","doi":"10.1109/WI-IAT.2011.138","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.138","url":null,"abstract":"Taxi service is an important mode of public transportation in most metropolitan areas since it provides door-to-door convenience in the public domain. Unfortunately, despite all the convenience taxis bring, taxi fleets are also extremely inefficient to the point that over 50% of its operation time could be spent in idling state. Improving taxi fleet operation is an extremely challenging problem, not just because of its scale, but also due to fact that taxi drivers are self-interested agents that cannot be controlled centrally. To facilitate the study of such complex and decentralized system, we propose to construct a multiagent simulation platform that would allow researchers to investigate interactions among taxis and to evaluate the impact of implementing certain management policies. The major contribution of our work is the incorporation of our analysis on the real-world driver's behaviors. Despite the fact that taxi drivers are selfish and unpredictable, by analyzing a huge GPS dataset collected from a major taxi fleet operator, we are able to clearly demonstrate that driver's movements are closely related to the relative attractiveness of neighboring regions. By applying this insight, we are able to design a background agent movement strategy that generates aggregate performance patterns that are very similar to the real-world ones. Finally, we demonstrate the value of such system with a real-world case study.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121481543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Time-Critical Decision Making in Interactive Dynamic Influence Diagram","authors":"Yi-feng Zeng, Yanping Xiang","doi":"10.1109/WI-IAT.2010.82","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.82","url":null,"abstract":"Time-critical dynamic decision making is a quite challenging task in many real-world applications. It requires to play a trade-off between solution optimality and computational tractability. It is especially true for multiagent settings under uncertainty. In this paper, we model time-critical dynamic decision problem using the representation of interactive dynamic influence diagram~(I-DID). We formalize I-DID by providing time-index to nodes within the model. This results in a model that has the ability to represent space-temporal abstraction. In addition, we propose a new method for selecting the abstract model without arbitrarily compromising solution optimality. We evaluate the performance of our method in two benchmark settings and provide results in support.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121435242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kan-Leung Cheng, Inon Zuckerman, U. Kuter, Dana S. Nau
{"title":"Using a Social Orientation Model for the Evolution of Cooperative Societies","authors":"Kan-Leung Cheng, Inon Zuckerman, U. Kuter, Dana S. Nau","doi":"10.1109/WI-IAT.2010.62","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.62","url":null,"abstract":"We utilize evolutionary game theory to study the evolution of cooperative societies and the behaviors of individual agents (i.e., players) in such societies. We present a novel player model based upon empirical evidence from the social and behavioral sciences stating that: (1) an individual’s behavior may often be motivated not only by self-interest but also by the consequences for others, and (2) individuals vary in their interpersonal social tendencies, which reflect stable personal orientations that influence their choices. Alongside the formal player model we provide an analysis that considers possible interactions between different types of individuals and identifies five general steady-state behavioral patterns. We present evolutionary simulations that ratify previous findings on evolution of cooperation, and provide new insights on the evolutionary process of cooperative behavior in a society as well as on the emergence of cooperative societies. Our main experimental result demonstrates that in contrast to previous common knowledge, increasing mutual reward or mutual punishment in the Prisoner’s dilemma game does not result in the same type of cooperative society: while increasing reward does increase the society’s cooperativeness level, increasing mutual punishment does not.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sergio Esparcia, E. Argente, Roberto Centeno, Ramón Hermoso
{"title":"Artifacting the Organizational Mechanisms: Adding Functionality in MAS Environments","authors":"Sergio Esparcia, E. Argente, Roberto Centeno, Ramón Hermoso","doi":"10.1109/WI-IAT.2010.58","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.58","url":null,"abstract":"Organizational mechanisms can be introduced in a multi-agent system with the aim of influencing the behavior of agents to achieve their objectives in a proper way. We propose to model organizational mechanisms by means of artifacts, which present good advantages for coordinating agents environments. We claim that artifacts, as reactive entities located into the environment of a Multi-agent System, can help agents to reach their goals, seem to be a suitable abstraction for modeling organizational mechanisms.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128176657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Behavior Design of Game Character's Agent","authors":"Tony Dujardin, J. Routier","doi":"10.1109/WI-IAT.2010.73","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.73","url":null,"abstract":"In human-level simulations, like video games can be, the design of character's behaviors has an important impact on simulation realism. We propose to divide it into a reasoning part, dedicated to a planner, and an individuality part, assigned to an action selection mechanism. Applying the separation of declarative and procedural aspects, the principle is to provide every character's agent with the same procedural mechanisms: the planner and the action selection mechanism. Declarative knowledge is then used at the agent level to individualize the behavior. The contribution of this paper consists in a motivation based action selection mechanism that allows individualization in behavior. The modularity provided by the motivations enables a large variety of behaviors for which the designer has to choose parameters. If the simulation of characters are our first motivation, the principles involved in the proposed motivation based action mechanism are general enough to be used in other contexts.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"63 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128240388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Gastro-Intestinal Tract Inspired Computational Paradigm","authors":"M. S. Awan, M. Awais","doi":"10.1109/IAT.2007.57","DOIUrl":"https://doi.org/10.1109/IAT.2007.57","url":null,"abstract":"The dynamic nature of handling undesirable, irritant and toxic items during digestion process by the defense mechanism associated with the Human Gastrointestinal Tract helps avoid intake of hazardous material in the body. The defense mechanism acts in coordination with the sensory organs and nervous system to keep a human healthy. In this paper, we have mapped the defense mechanism associated with the Human Gastrointestinal Tract from the biological/nature domain to the computer science/information technology domain for proposing a Gastrointestinal Tract Inspired Computing Model. The proposed model has its roots purely in the biological domain with the softbots used as the main building block for processing. The processing is facilitated by a centralized learning center that mimics the human nervous system functionality.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automatically Defined Swarms for Task Allocation","authors":"W. Drozd","doi":"10.1109/IAT.2007.35","DOIUrl":"https://doi.org/10.1109/IAT.2007.35","url":null,"abstract":"Insect inspired task allocation schemes have received significant attention as a way to control agents in dynamic or uncertain domains. This is largely because such mechanisms rely on only simple definitions of agent behavior, a small amount of communication and a high-degree of fault tolerance. However, it is often difficult to conceptualize the appropriate learning and decision rules for these agents since in the case of swarm-intelligence approaches, the focus is not on an individual agent's ability to optimize its behavior, but on the resulting performance of the entire complex system. Although there have been successes in a variety of domains in the past, many of these approaches have required considerable effort by the researcher to tailor the canonical definition to the specific problem at hand. This paper presents a generalized framework for solving multiagent task allocation problems using the insect-inspired model. I then show that because of the inherent simplicity of the agent's design, we can automatically define these learning and decision rules. A multi-robot task allocation experiment has been defined and performed. The results show how these automatically-defined behaviors outperform existing manually defined behaviors. What follows is a reusable and automatic approach to developing customized insect inspired agent behaviors for use with any dynamic task allocation problem.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization","authors":"Adrian Petcu, B. Faltings","doi":"10.1109/IAT.2007.10","DOIUrl":"https://doi.org/10.1109/IAT.2007.10","url":null,"abstract":"We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarantee completeness. We propose LS-DPOP(k), a hybrid method that combines the advantages of both these approaches. LS-DPOP(k) is a utility propagation algorithm controlled by a parameter k which specifies the maximal allowable amount of inference. The maximal space requirements are exponential in this parameter. In the dense parts of the problem, where the required amount of inference exceeds this limit, the algorithm executes a local search procedure guided by as much inference as allowed by k. LS-DPOP(k) can be seen as a large neighborhood search, where exponential neighborhoods are rigorously determined according to problem structure, and polynomial efforts are spent for their complete exploration at each local search step. We show the efficiency of this approach with experimental results from the distributed meeting scheduling domain.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127203566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Concept of Autonomy in Distributed Computation and Multi-agent Systems","authors":"M. Nowostawski, M. Purvis","doi":"10.1109/IAT.2007.97","DOIUrl":"https://doi.org/10.1109/IAT.2007.97","url":null,"abstract":"The concept of autonomy is a central concept in distributed computational systems and in multi-agent systems in particular. Most researchers do not discuss the details of this concept, but rather assume a general, common-sense understanding of autonomy in the context of computational multi-agent systems. We review existing definitions and formalisms related to the notion of autonomy. We re-introduce two concepts: relative autonomy and absolute autonomy. We adopt and discuss a new formalism based on results from the study of massively parallel multi-agent systems in the context of evolvable virtual machines. We argue that for open distributed systems, entities must be connected by multiple computational dependencies and a system as a whole must be subjected to influence from external sources. However, the exact linkages are not directly known to the computational entities themselves. This provides a useful notion and the necessary means to establish a relative autonomy in such systems.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Agent-Based Air Traffic Control in Airport Airspace","authors":"V. Gorodetsky, O. Karsaev, V. Kupin, V. Samoilov","doi":"10.1109/IAT.2007.23","DOIUrl":"https://doi.org/10.1109/IAT.2007.23","url":null,"abstract":"The paper presents multi agent system approach and software prototype aimed at the air traffic control in airport airspace. The system consists of agents playing roles of assistant aircraft crews and assistant air traffic control operator of approach zone. According to selected organizational structure of multi agent system two different approaches to air traffic control are used. Within the approach zone coordination of agents' behavior is based on decisions made by assistant operator agent. Within the arrival zone assistant aircraft crews' agents make decision autonomously using a priory agreed behavior policy.","PeriodicalId":123634,"journal":{"name":"ACM International Conference on International Agent Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121484614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}