This work presents a modular hybrid timed Petri net (MHTPN) methodology used to study multi-operational production systems in which parts are used for the production of different product types. This research generaliz...
详细信息
This work presents a modular hybrid timed Petri net (MHTPN) methodology used to study multi-operational production systems in which parts are used for the production of different product types. This research generalizes work presented in Tsinarakis, GJ et al., (2003) that studied production systems where all parts of the same type were used for the production of a type of final products following a common route. 3 fundamental system modules are derived; their MHTPN models are defined, followed by modules synthesis to obtain the overall system Petri net. For any topology, system's nodes and invariants are calculated. Applicability of the method is illustrated through an analytical example.
This paper presents an algorithm for task allocation in groups of homogeneous robots. The algorithm is based on vacancy chains, a resource distribution strategy common in human and animal societies. We define a class ...
详细信息
This paper presents an algorithm for task allocation in groups of homogeneous robots. The algorithm is based on vacancy chains, a resource distribution strategy common in human and animal societies. We define a class of task-allocation problems for which the vacancy chain algorithm is suitable and demonstrate how reinforcement learning can be used to make vacancy chains emerge in a group of behavior-based robots. Experiments in simulation show that the vacancy chain algorithm consistently outperforms random and static task allocation algorithms when individual robots are prone to distractions or breakdowns, or when task priorities change.
This paper describes a cooperative method for relative localization of mobile robot teams;that is, it describes a method whereby every robot in the team can estimate the pose of every other robot, relative to itself. ...
详细信息
This paper describes a cooperative method for relative localization of mobile robot teams;that is, it describes a method whereby every robot in the team can estimate the pose of every other robot, relative to itself. This method does not require the use GPS, landmarks, or maps of any kind;instead, robots make direct measurements of the relative pose of nearby robots, and broadcast this information to the team as a whole. Each robot processes this information independently to generate an ego-centric estimate for the pose of other robots. Our method uses a Bayesian formalism with a particle filter implementation, and is, as a consequence, very robust. It is also completely distributed, yet requires relatively little communication between robots. This paper describes the basic ego-centric formalism, sketches the implementation, and presents experimental results obtained using a team of four mobile robots.
This paper describes a behavior-based approach to stealth. The specific problem we consider is that of making stealthy traverses, i.e., transiting from one point to another while remaining hidden from an observer. Sin...
详细信息
This paper describes a behavior-based approach to stealth. The specific problem we consider is that of making stealthy traverses, i.e., transiting from one point to another while remaining hidden from an observer. Since we assume that the robot has no a priori model of the environment, our stealthy traverse behavior makes opportunistic use of terrain features to hide from the observer. This behavior has been evaluated in both real and simulated experiments, comparing it against a regular goal-seeking/obstacle-avoidance behavior. These experiments show a clear improvement in the stealthiness of the robot.
We present DINTA, distributed in-network task allocation - a novel paradigm for multi-robot task allocation (MRTA) where tasks are allocated implicitly to robots by a pre-deployed, static sensor network. Experimental ...
详细信息
We present DINTA, distributed in-network task allocation - a novel paradigm for multi-robot task allocation (MRTA) where tasks are allocated implicitly to robots by a pre-deployed, static sensor network. Experimental results with a simulated alarm scenario show that our approach is able to compute solutions to the MRTA problem in a distributed fashion. We compared our approach to a strategy where robots use the deployed sensor network for efficient exploration. The data show that our approach outperforms such an exploration-only algorithm. The data also provide evidence that the proposed algorithm is more stable than the exploration-only algorithm.
We study the problem of exploring an unknown environment using a single robot. The environment is large enough (and possibly dynamic) that constant motion by the robot is needed to cover the environment. We term this ...
详细信息
We study the problem of exploring an unknown environment using a single robot. The environment is large enough (and possibly dynamic) that constant motion by the robot is needed to cover the environment. We term this the dynamic coverage problem. We present an efficient minimalist algorithm which assumes that global information is not available to the robot (neither a map, nor GPS). Our algorithm uses markers which the robot drops off as signposts to aid exploration. We conjecture that our algorithm has a cover time better than O(n log n), where the n markers that are deployed form the vertices of a regular graph. We provide experimental evidence in support of this conjecture. We show empirically that the performance of our algorithm on graphs is similar to its performance in simulation.
This paper describes how environmental complexity measures can be employed in the process of validating experimental robotics work. We advocate the use of metrics that attempt to quantify the 'difficulty' of m...
详细信息
This paper describes how environmental complexity measures can be employed in the process of validating experimental robotics work. We advocate the use of metrics that attempt to quantify the 'difficulty' of motion for a given environment. Space syntax methods (from the urban and building design literature) and fluid-flow models (used in crowd modeling) are described and proposed as relevant measures for mobile robotics domains. We show experimentally that these two metrics give very different expressions of complexity. We then discuss how, given their properties, these different metrics may be applied to robotics controller design and evaluation.
This paper describes a cooperative method for relative localization of mobile robot teams; that is, it describes a method whereby every robot in the team can estimate the pose of every other robot, relative to itself....
详细信息
This paper describes a cooperative method for relative localization of mobile robot teams; that is, it describes a method whereby every robot in the team can estimate the pose of every other robot, relative to itself. This robot does not require the use of GPS, landmarks, or maps of any kind; instead, robots make direct measurement of the relative pose of nearby robots, and broadcast this information to the team as a whole. Each robot processes this information independently to generate ego-centric estimate for the pose of other robots. Our method uses Bayesian formalism with a particle filter implementation, and is, as a consequence, very robust. It is also completely distributed, yet requires relatively little communication between robots. This paper describes the basic ego-centric formalism, sketches the implementation, and presents experimental results obtained using a team of four mobile robots.
This paper describes a behavior-based approach to stealth. The specific problem we consider is that of making stealthy traverses, i.e., transiting from one point to another while remaining hidden from an observer. Sin...
详细信息
This paper describes a behavior-based approach to stealth. The specific problem we consider is that of making stealthy traverses, i.e., transiting from one point to another while remaining hidden from an observer. Since we assume that the robot has no a priori model of the environment, our stealthy traverse behavior makes opportunistic use of terrain features to hide from the observer. This behavior has been evaluated in both real and simulated experiments, comparing it against a regular goal-seeking/obstacle-avoidance behavior. These experiments show a clear improvement in the stealthiness of the robot.
暂无评论