6,989 research outputs found

    Determining robot actions for tasks requiring sensor interaction

    Get PDF
    The performance of non-trivial tasks by a mobile robot has been a long term objective of robotic research. One of the major stumbling blocks to this goal is the conversion of the high-level planning goals and commands into the actuator and sensor processing controls. In order for a mobile robot to accomplish a non-trivial task, the task must be described in terms of primitive actions of the robot's actuators. Most non-trivial tasks require the robot to interact with its environment; thus necessitating coordination of sensor processing and actuator control to accomplish the task. The main contention is that the transformation from the high level description of the task to the primitive actions should be performed primarily at execution time, when knowledge about the environment can be obtained through sensors. It is proposed to produce the detailed plan of primitive actions by using a collection of low-level planning components that contain domain specific knowledge and knowledge about the available sensors, actuators, and sensor/actuator processing. This collection will perform signal and control processing as well as serve as a control interface between an actual mobile robot and a high-level planning system. Previous research has shown the usefulness of high-level planning systems to plan the coordination of activities such to achieve a goal, but none have been fully applied to actual mobile robots due to the complexity of interacting with sensors and actuators. This control interface is currently being implemented on a LABMATE mobile robot connected to a SUN workstation and will be developed such to enable the LABMATE to perform non-trivial, sensor-intensive tasks as specified by a planning system

    Asymptotic robustness of Kelly's GLRT and Adaptive Matched Filter detector under model misspecification

    Full text link
    A fundamental assumption underling any Hypothesis Testing (HT) problem is that the available data follow the parametric model assumed to derive the test statistic. Nevertheless, a perfect match between the true and the assumed data models cannot be achieved in many practical applications. In all these cases, it is advisable to use a robust decision test, i.e. a test whose statistic preserves (at least asymptotically) the same probability density function (pdf) for a suitable set of possible input data models under the null hypothesis. Building upon the seminal work of Kent (1982), in this paper we investigate the impact of the model mismatch in a recurring HT problem in radar signal processing applications: testing the mean of a set of Complex Elliptically Symmetric (CES) distributed random vectors under a possible misspecified, Gaussian data model. In particular, by using this general misspecified framework, a new look to two popular detectors, the Kelly's Generalized Likelihood Ration Test (GLRT) and the Adaptive Matched Filter (AMF), is provided and their robustness properties investigated.Comment: ISI World Statistics Congress 2017 (ISI2017), Marrakech, Morocco, 16-21 July 201

    Flexible Decision Control in an Autonomous Trading Agent

    Get PDF
    An autonomous trading agent is a complex piece of software that must operate in a competitive economic environment and support a research agenda. We describe the structure of decision processes in the MinneTAC trading agent, focusing on the use of evaluators – configurable, composable modules for data analysis and prediction that are chained together at runtime to support agent decision-making. Through a set of examples, we show how this structure supports sales and procurement decisions, and how those decision processes can be modified in useful ways by changing evaluator configurations. To put this work in context, we also report on results of an informal survey of agent design approaches among the competitors in the Trading Agent Competition for Supply Chain Management (TAC SCM).autonomous trading agent;decision processes

    Unique and interactive effects of moral emotions and moral disengagement on bullying and defending among school children

    Get PDF
    The first aim of the present study was to examine in a single model how moral disengagement and moral emotions were related to bullying and defending behavior among schoolchildren. The second aim was to test whether the two moral dimensions interacted with each other to explain behavior in bullying situations. Data were collected from 561 Swedish students. Moral disengagement was positively associated with bullying and negatively associated with defending, whereas moral emotions score was negatively associated with bullying and positively associated with defending. Moreover, students who scored high in moral emotions did not tend to bully other students, irrespective of their levels of moral disengagement, whereas when the moral emotions score was low bullying behavior increased with increasing levels of moral disengagement. In contrast, moral disengagement was negatively related to defending behavior at low levels of moral emotions, but not when moral emotions were high

    An Evolutionary Framework for Determining Heterogeneous Strategies in Multi-Agent Marketplaces

    Get PDF
    We propose an evolutionary approach for studying the dynamics of interaction of strategic agents that interact in a marketplace. The goal is to learn which agent strategies are most suited by observing the distribution of the agents that survive in the market over extended periods of time. We present experimental results from a simulated market, where multiple service providers compete for customers using different deployment and pricing schemes. The results show that heterogeneous strategies evolve and co-exist in the same market.marketing;simulation;multi-agent systems;complexity economics;trading agents

    Predit: A temporal predictive framework for scheduling systems

    Get PDF
    Scheduling can be formalized as a Constraint Satisfaction Problem (CSP). Within this framework activities belonging to a plan are interconnected via temporal constraints that account for slack among them. Temporal representation must include methods for constraints propagation and provide a logic for symbolic and numerical deductions. In this paper we describe a support framework for opportunistic reasoning in constraint directed scheduling. In order to focus the attention of an incremental scheduler on critical problem aspects, some discrete temporal indexes are presented. They are also useful for the prediction of the degree of resources contention. The predictive method expressed through our indexes can be seen as a Knowledge Source for an opportunistic scheduler with a blackboard architecture
    corecore