agent-oriented programming (AOP) researchers have successfully developed a range of agentprogramming languages that bridge the gap between theory and practice. Unfortunately, despite the in-community success of these...
详细信息
ISBN:
(纸本)9783319255248;9783319255231
agent-oriented programming (AOP) researchers have successfully developed a range of agentprogramming languages that bridge the gap between theory and practice. Unfortunately, despite the in-community success of these languages, they have proven less compelling to the wider software engineering community. One of the main problems facing AOP language developers is the need to bridge the cognitive gap that exists between the concepts underpinning mainstream languages and those underpinning AOP. In this paper, we attempt to build such a bridge through a conceptual mapping that we subsequently use to drive the design of a new programming language entitled ASTRA, which has been evaluated by a group of experienced software engineers attending an agent-oriented Software Engineering Masters course.
For creativity to be computed, it is paramount to understand the cognitive processes involved, which have been elucidated by either surveying creative people or discovering regions of the human brain that activate dur...
详细信息
For creativity to be computed, it is paramount to understand the cognitive processes involved, which have been elucidated by either surveying creative people or discovering regions of the human brain that activate during creative endeavors. From this scattering, the author proposes a holistic framework to describe them and their interaction. Hence, creativity can be regarded as a meta process which coordinates autonomous cognitive processes such as planning or divergent thinking. To represent the interplay of cognitive processes around creativity, models are developed in the agent Unified Modeling Language (AUML). Then, the execution of each process is delegated to autonomous agents and a global coordination protocol is devised. The implementation of the MAS is done on the JADE platform. Two modules of the resultant system are exemplified: opus planning and divergent exploration. The coordination protocol is also presented. The domain in which the software system is tested is the creation of musical pieces. (C) 2012 Elsevier Ltd. All rights reserved.
This paper proposes a multi-agent approach to power system restoration. The proposed system consists of a number of bus agents (BAGs) and a single facilitator agent (FAG). BAG is developed to decide a suboptimal targe...
详细信息
This paper proposes a multi-agent approach to power system restoration. The proposed system consists of a number of bus agents (BAGs) and a single facilitator agent (FAG). BAG is developed to decide a suboptimal target configuration after a fault occurrence by interacting with other BAGs based on only locally available information, while FAG is to act as a manager in the decision process. The interaction of several simple agents leads to a dynamic system, allowing efficient approximation of a solution. Simulation results have demonstrated that this method is able to reach suboptimal target configurations, which are favorably compared with those obtained by a mathematical programming approach.
This work proposes a novel high-level paradigm, agent planning programs, for modeling agents behavior, which suitably mixes automated planning with agent-oriented programming. agent planning programs are finite-state ...
详细信息
This work proposes a novel high-level paradigm, agent planning programs, for modeling agents behavior, which suitably mixes automated planning with agent-oriented programming. agent planning programs are finite-state programs, possibly containing loops, whose atomic instructions consist of a guard, a maintenance goal, and an achievement goal, which act as precondition-invariance-postcondition assertions in program specification. Such programs are to be executed in possibly nondeterministic planning domains and their execution requires generating plans that meet the goals specified in the atomic instructions, while respecting the program control flow. In this paper, we define the problem of automatically synthesizing the required plans to execute an agent planning program, propose a solution technique based on model checking of two-player game structures, and use it to characterize the worst-case computational complexity of the problem as EXPTIME-complete. Then, we consider the case of deterministic domains and propose a different technique to solve agent planning programs, which is based on iteratively solving classical planning problems and on exploiting goal preferences and plan adaptation methods. Finally, we study the effectiveness of this approach for deterministic domains through an experimental analysis on well-known planning domains. (C) 2015 Elsevier B.V. All rights reserved.
Even though the agentorientedprogramming (AOP) paradigm has been introduced over 20 years ago, the following is still modest. We believe this is partially due to the lack of the community to address such real world ...
详细信息
Even though the agentorientedprogramming (AOP) paradigm has been introduced over 20 years ago, the following is still modest. We believe this is partially due to the lack of the community to address such real world issues as concurrency and distribution. In this paper we take a look at the possibility of combining elements from the Join Calculus, namely join patterns with an AOP programming language, in our case Jason. We discuss some of the implications, advantages and possible drawbacks.
This article proposes an extension for the agents and Artifacts meta-model to enable modularization. We adopt the Belief-Desire-Intention (BDI) model of agency to represent independent and reusable units of code by me...
详细信息
This article proposes an extension for the agents and Artifacts meta-model to enable modularization. We adopt the Belief-Desire-Intention (BDI) model of agency to represent independent and reusable units of code by means of modules. The key idea behind our proposal is to take advantage of the syntactic notion of namespace, i.e., a unique symbol identifier to organize a set of programming elements. On this basis, agents can decide in BDI terms which beliefs, goals, events, percepts and actions will be independently handled by a particular module. The practical feasibility of this approach is demonstrated by developing an auction scenario, where source code enhances scores of coupling, cohesion and complexity metrics, when compared against a non-modular version of the scenario. Our solution allows to address the namecollision issue, provides a use interface for modules that follows the information hiding principle, and promotes software engineering principles related to modularization such as reusability, extensibility and maintainability. Differently from others, our solution allows to encapsulate environment components into modules as it remains independent from a particular BDI agent-oriented programming language.
This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-based agent-oriented programming language agentS...
详细信息
This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-based agent-oriented programming language agentSpeak into either Promela or Java, and then use the associated Spin and JPF model checkers to verify the resulting systems. We also describe the simplified BDI logical language that is used to write the properties we want the systems to satisfy. The approach is illustrated by means of a simple case study.
This paper describes a new approach to the production of robust software. We first motivate the approach by explaining why the two major goals of software engineering - correct software and reusable software - are not...
详细信息
This paper describes a new approach to the production of robust software. We first motivate the approach by explaining why the two major goals of software engineering - correct software and reusable software - are not being addressed by the current state of software practice. We then describe a methodology based on active, cooperative, and persistent software components, i.e., agents, and show how the methodology produces robust and reusable software. We derive requirements for the structure and behavior of the agents, and report on preliminary experiments on applications based on the methodology. We conclude with a roadmap for development of the methodology and ruminations about uses for the new computational paradigm.
agent-building tools have an important role in popularizing agent technology. This paper describes a new agent-programming tool AJA. AJA consists of two programming languages: HADL for defining of higher-level agent c...
详细信息
agent-building tools have an important role in popularizing agent technology. This paper describes a new agent-programming tool AJA. AJA consists of two programming languages: HADL for defining of higher-level agent constructs and Java+ for low-level programming of these constructs. Among other interesting features AJA presents an original approach of incorporating artificial intelligence techniques, such as artificial neural nets, into a programming language.
This paper proposes a multi-agent approach to power system restoration. The proposed system consists of several Bus agents (BAGs) and a single Facilitator agent (FAG). A BAG is developed to decide a sub-optimal target...
详细信息
ISBN:
(纸本)0780366727
This paper proposes a multi-agent approach to power system restoration. The proposed system consists of several Bus agents (BAGs) and a single Facilitator agent (FAG). A BAG is developed to decide a sub-optimal target configuration after faults occur by interacting with other BAGs, while a FAG is developed to act as a manager for the decision process, The interaction of several simple agents leads to a dynamic system allowing efficient approximation of a solution. It is shown from simulation results that this method is able to obtain sub-optimal target configurations which are the same as ones obtained by a mathematical programming approach.
暂无评论