A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial computers to robustly achieve global compu...
ISBN:
(纸本)9780981738116
A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial computers to robustly achieve global computational tasks. this paper develops a principled approach to global-to-local programming, for pattern formation problems in a one-dimensional multi-agent model. We present theoretical analysis that addresses the existence, construction, and resource tradeoffs of robust local rule solutions to global patterns, and which together form a "global-to-local compiler".
作者:
Yingxu WangInternational Center for Cognitive Informatics (ICfCI)
Theoretical and Empirical Software Engineering Research Centre (TESERC) Department of Electrical and Computer Engineering Schulich School of Engineering University of Calgary Calgary AB Canada
Recent researches reveal that various paradigms of intelligence, such as natural, artificial, machinable, and computational intelligence, can be unified at the logical and functional levels known as abstract intellige...
详细信息
ISBN:
(纸本)9781424425389
Recent researches reveal that various paradigms of intelligence, such as natural, artificial, machinable, and computational intelligence, can be unified at the logical and functional levels known as abstract intelligence. this paper introduces abstract intelligence as a form of driving force that transfers information into knowledge and behaviors. An architectural framework of abstract intelligence and the generic abstract intelligence mode (GAIM) are formally developed that provide a unified theory for explaining the mechanisms of advanced intelligence. In order to deal withthe highly complex and abstract objects in abstract intelligence, denotational mathematics is introduced as a category of expressive mathematical structures for modeling and manipulating high-level mathematical entities beyond numbers and sets, such as abstract objects, complex relations, behavioral information, abstract concepts, knowledge, processes, and systems. Applications of denotational mathematics in abstract intelligence, cognitive informatics, and computational intelligence are elaborated.
Unmanned aerial vehicles (UAVs) are gaining in popularity across a broad spectrum of applications and fields. Two of the main challenges faced when developing autonomous, multi-agent UAV systems is the software develo...
详细信息
Unmanned aerial vehicles (UAVs) are gaining in popularity across a broad spectrum of applications and fields. Two of the main challenges faced when developing autonomous, multi-agent UAV systems is the software development and simulation cycle and the flight test cycle. Each of these aspects can be time consuming and introduce other difficulties, ultimately hindering the mission design and development cycle. In order to address the drawbacks of conventional UAV systems development, the vehicle abstraction layer (VAL) is being developed as part of the Quanser Cooperative Control Framework (QCCF). the goal of the VAL is to provide a robust, portable, multi-agent cooperative control rapid prototyping environment for unmanned aircraft. the VAL allows for vehicle simulation as well as actual flight testing using the same framework, alleviating the need for iterative in-field testing and minimizing the transition from simulation to flight. the VAL enables high-level decision making and control design for multi-vehicle control, high-fidelity simulation and seamless integration on any real Commercial Off-the-Shelf (COTS) UAV system. the framework is open with existing modules (such as vehicle models) available for use as templates for the addition of user-supplied components.
Military task programming is an important foundation in military warfare simulations. Presently, scenarios in joint military warfare are built not so good to meet the requirement of aggregate-level warfare simulations...
详细信息
Military task programming is an important foundation in military warfare simulations. Presently, scenarios in joint military warfare are built not so good to meet the requirement of aggregate-level warfare simulations and the requirement of intelligent decision in real time simulations. A method based on FSM model of aggregate-level military warfare decision-making and vehicle-level action decision-making is proposed in this paper. the programming process of joint military warfare with decision-making functions can be realized through the programming of these two levels, and the dynamic decision-making and execution of mission can be completed successfully.
In this paper we describe the design and initial evaluation of a tangible computer programming exhibit for children on display at the Boston Museum of Science. We also discuss five design considerations for tangible i...
详细信息
ISBN:
(纸本)9781595939944
In this paper we describe the design and initial evaluation of a tangible computer programming exhibit for children on display at the Boston Museum of Science. We also discuss five design considerations for tangible interfaces in science museums that guided our development and evaluation. In doing so, we propose the notion of passive tangible interfaces. Passive tangibles serve as a way to address practical issues involving tangible interaction in public settings and as a design strategy to promote reflective thinking. Results from our evaluation indicate that passive tangibles can preserve many of the benefits of tangible interaction for informal science learning while remaining cost-effective and reliable.
there is an increasing number of agent-oriented programming languages that have working interpreters and platforms, with significant progress in the quality of such platforms over the last few years. Withthese platfo...
详细信息
ISBN:
(纸本)9780981738123
there is an increasing number of agent-oriented programming languages that have working interpreters and platforms, with significant progress in the quality of such platforms over the last few years. Withthese platforms becoming more popular, and multi-agent systems being increasingly used for safety-critical applications, the need for verification techniques that apply to systems written in such languages is proportionally intensified. Building on our previous work on model checking for a particular agent-oriented programming language, we have developed a new approach whereby model checking techniques can be used directly on a variety of such languages. the approach also supports the verification of multi-agent systems where individual agents have been programmed in different agent languages.
In this paper we propose an explicit form of knowledge-based programming. Our initial motivation is the distributed implementation of game-theoretical algorithms, but we abstract away from the game-theoretical details...
详细信息
ISBN:
(纸本)9780981738123
In this paper we propose an explicit form of knowledge-based programming. Our initial motivation is the distributed implementation of game-theoretical algorithms, but we abstract away from the game-theoretical details and describe a general scenario, where a group of agents each have some initially private bits of information which they can then communicate to each other. We draw on existing literature to give a formal model using modal logic to represent the knowledge of the agents as well as how that knowledge changes as they communicate. We sketch an implementation which enables processes in a distributed system to explicitly evaluate knowledge formulae. then we prove that the implementation captures the formal model, and therefore correctly reflects the general scenario. Finally we look at how our approach lends itself to generalisations, and discuss application perspectives.
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions such t...
ISBN:
(纸本)9780981738123
Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of partitioning the set of agents into exhaustive and disjoint coalitions such that the social welfare is maximized. this coalition structure generation problem is extremely challenging due to the exponential number of partitions that need to be examined. Specifically, given n agents, there are O(nn) possible partitions. To date, the only algorithm that can find an optimal solution in O(3n) is the Dynamic programming (DP) algorithm, due to Rothkopf et al. However, one of the main limitations of DP is that it requires a significant amount of memory. In this paper, we devise an Improved Dynamic programming algorithm (IDP) that is proved to perform fewer operations than DP (e.g. 38.7% of the operations given 25 agents), and is shown to use only 33.3% of the memory in the best case, and 66.6% in the worst.
In the literature on agent systems, the proactive behavior of agents is often modeled in terms of goals that the agents pursue. We review a number of commonly-used existing goal types and propose a simple and general ...
详细信息
ISBN:
(纸本)9780981738116
In the literature on agent systems, the proactive behavior of agents is often modeled in terms of goals that the agents pursue. We review a number of commonly-used existing goal types and propose a simple and general definition of goal, which unifies these goal types. We then give a formal and generic operationalization of goals by defining an abstract goal architecture, which describes the adoption, pursuit, and dropping of goals in a generic way. this operationalization is used to characterize the discussed goal types.
In this paper, we develop a formal model of planning for an agent that is operating in a dynamic and incompletely known environment. We assume that boththe agent's task and the behavior of the agents in the envir...
详细信息
ISBN:
(纸本)9780981738109
In this paper, we develop a formal model of planning for an agent that is operating in a dynamic and incompletely known environment. We assume that boththe agent's task and the behavior of the agents in the environment are expressed as high-level nondeterministic concurrent programs in some agent programming language (APL). In this context, planning must produce a deterministic conditional plan for the agent that can be successfully executed against all possible executions of the environment program. We handle actions with nondeterministic effects, as well as sensing actions, by treating them as actions that trigger an environmental reaction that is not under the planning agent's control. Our model of contingent planning is specified for a generic APL with a transition semantics. Within this model, we devise a general procedure for computing the contingent plans. We also show how the model can be instantiated in the situation calculus with programs for the agent and the environment expressed in ConGolog, and we describe an implementation of the planning mechanism in this case.
暂无评论