scholarly journals A Procedure Model for Low Emission Transportation Chain Planning

2021 ◽  
Vol 33 (6) ◽  
pp. 893-904
Author(s):  
Larissa Lößer
Keyword(s):  
Reference Model ◽  
Freight Transportation ◽  
Decision Processes ◽  
Planning Problem ◽  
Planning Approach ◽  
Low Emission ◽  
Literature Reviews ◽  
Sustainable Planning ◽  
Strategic Solution ◽  
Procedure Model

Low-emission planning in freight transportation is one of the main levers to reduce greenhouse gas emissions. For a sustainable planning approach, a strategic solution for this planning problem is needed. Based on several literature reviews, a procedure model is developed, which is meant to be used for the development and adjustment of a low-emission transportation chain reference model. The procedure model consists of the decision steps needed to develop a low-emission transportation chain (LETC) reference model and it is structured into main decision processes and sub-decision processes. A first draft of the LETC-Model is presented in form of an ARIS-Express model.  

A SAT-Based Planning Approach for Finding Logical Attacks on Cryptographic Protocols

2020 ◽  
Vol 14 (4) ◽  
pp. 1-21
Author(s):  
Noureddine Aribi ◽  
Yahia Lebbah
Keyword(s):  
Model Checking ◽  
State Of The Art ◽  
Cryptographic Protocols ◽  
Protocol Verification ◽  
Planning Problem ◽  
Multiparty Communication ◽  
Planning Approach ◽  
Security Properties ◽  
Sat Solver ◽  
Security Property

Cryptographic protocols form the backbone of digital society. They are concurrent multiparty communication protocols that use cryptography to achieve security goals such as confidentiality, authenticity, integrity, etc., in the presence of adversaries. Unfortunately, protocol verification still represents a critical task and a major cost to engineer attack-free security protocols. Model checking and SAT-based techniques proved quite effective in this context. This article proposes an efficient automatic model checking approach that exemplifies a security property violation. In this approach, a protocol verification is abstracted as a compact planning problem, which is efficiently solved by a state-of-the-art SAT solver. The experiments performed on some real-world cryptographic protocols succeeded in detecting new logical attacks, violating some security properties. Those attacks encompass both “type flaw” and “replay” attacks, which are difficult to tackle with the existing planning-based approaches.

scholarly journals A Multiagent Planning Approach for Cooperative Patrolling with Non-Stationary Adversaries

2017 ◽  
Vol 26 (05) ◽  
pp. 1760018 ◽  
Author(s):  
Aurélie Beynier
Keyword(s):  
Response Strategy ◽  
Planning Problem ◽  
Uncertain Environments ◽  
Illegal Fishing ◽  
Best Response ◽  
Planning Approach ◽  
History Of ◽  
Multiagent Planning ◽  
On Line ◽  
Over Time

Multiagent patrolling is the problem faced by a set of agents that have to visit a set of sites to prevent or detect some threats or illegal actions. Although it is commonly assumed that patrollers share a common objective, the issue of cooperation between the patrollers has received little attention. Over the last years, the focus has been put on patrolling strategies to prevent a one-shot attack from an adversary. This adversary is usually assumed to be fully rational and to have full observability of the system. Most approaches are then based on game theory and consists in computing a best response strategy. Nonetheless, when patrolling frontiers, detecting illegal fishing or poaching; patrollers face multiple adversaries with limited observability and rationality. Moreover, adversaries can perform multiple illegal actions over time and space and may change their strategies as time passes. In this paper, we propose a multiagent planning approach that enables effective cooperation between a team of patrollers in uncertain environments. Patrolling agents are assumed to have partial observability of the system. Our approach allows the patrollers to learn a generic and stochastic model of the adversaries based on the history of observations. A wide variety of adversaries can thus be considered with strategies ranging from random behaviors to fully rational and informed behaviors. We show that the multiagent planning problem can be formalized by a non-stationary DEC- POMDP. In order to deal with the non-stationary, we introduce the notion of context. We then describe an evolutionary algorithm to compute patrolling strategies on-line, and we propose methods to improve the patrollers’ performance.

scholarly journals A Constraint-based Mission Planning Approach for Reconfigurable Multi-Robot Systems

2018 ◽  
Vol 21 (62) ◽  
pp. 25
Author(s):  
Thomas M Roehr
Keyword(s):  
Degrees Of Freedom ◽  
Resource Constraints ◽  
Mission Planning ◽  
General Nature ◽  
Planning Problem ◽  
Modular Systems ◽  
Planning Approach ◽  
Robot Systems ◽  
Revised Definitions ◽  
Multi Robot

The application of reconfigurable multi-robot systems introduces additional degrees of freedom to design robotic missions compared to classical multi-robot systems. To allow for autonomous operation of such systems, planning approaches have to be investigated that cannot only cope with the combinatorial challenge arising from the increased flexibility of modular systems, but also exploit this flexibility to improve for example the safety of operation. While the problem originates from the domain of robotics it is of general nature and significantly intersects with operations research. This paper suggests a constraint-based mission planning approach, and presents a set of revised definitions for reconfigurable multi-robot systems including the representation of the planning problem using spatially and temporally qualified resource constraints. Planning is performed using a multi-stage approach and a combined use of knowledge-based reasoning, constraint-based programming and integer linear programming. The paper concludes with the illustration of the solution of a planned example mission.

scholarly journals Minimum-jerk trajectory planning pertaining to a translational 3-degree-of-freedom parallel manipulator through piecewise quintic polynomials interpolation

2020 ◽  
Vol 12 (3) ◽  
pp. 168781402091366 ◽  
Author(s):  
Song Lu ◽  
Bingxiao Ding ◽  
Yangmin Li
Keyword(s):  
Trajectory Planning ◽  
Virtual Work ◽  
Angular Position ◽  
Programming Algorithm ◽  
Planning Problem ◽  
Typical Application ◽  
Parallel Kinematic Manipulator ◽  
Minimum Jerk ◽  
Planning Approach ◽  
Parallel Kinematic

This article aims to present a minimum-jerk trajectory planning approach to address the smooth trajectory generation problem of 3-prismatic-universal-universal translational parallel kinematic manipulator. First, comprehensive kinematics and dynamics characteristics of this 3-prismatic-universal-universal parallel kinematic manipulator are analyzed by virtue of the accepted link Jacobian matrices and proverbial virtual work principle. To satisfy indispensable continuity and smoothness requirements, the discretized piecewise quintic polynomials are employed to interpolate the sequence of joints’ angular position knots which are transformed from these predefined via-points in Cartesian space. Furthermore, the trajectory planning problem is directly converted into a constrained nonlinear multi-variables optimization problem of which objective function is to minimize the maximum of the joints’ angular jerk throughout the whole trajectory. Finally, two typical application simulations using the reliable sequential quadratic programming algorithm demonstrate that this proposed minimum-jerk trajectory planning approach is of explicit feasibility and appreciable effectiveness.

Handoff Cost Minimization and Planning of Heterogeneous Integrated Overlay Networks

2012 ◽  
pp. 49-64
Author(s):  
Ayan Paul ◽  
Madhubanti Maitra ◽  
Swarup Mandal ◽  
Samir Kumar Sadhukhan
Keyword(s):  
Overlay Networks ◽  
Cost Minimization ◽  
Cost Effective ◽  
Overlay Network ◽  
Vertical Handoff ◽  
Planning Problem ◽  
Network Resources ◽  
Planning Approach ◽  
Technology Market ◽  
The Cost

The wireless technology market has witnessed a complete paradigm shift as multiple standards and protocols are emerging almost every day. Each and every standard has its limitations and merits, which can be either masked or complemented by some other standards. The demands from the service providers are now sky-high and for the complete commercialization, it is expected that even with scarce network resources all kind of services would be provided, especially in a cost effective manner. This burning issue compels a service provider to roll out some integrated wireless networks to exploit the virtues of each. This chapter formulates the planning problem of an overlay network integrating particularly, 3G, WiMAX, and WLAN. The issue of planning is to establish proper connectivity amongst the three network standards which is unique in its nature. In the proposed planning approach, the authors have endeavored to minimize total cost for vertical handoff generated in the overlay network as well as the cost for wire line connection amongst the various network gateways of the overlay hierarchy. In this work, the authors have focused on the initial planning phase. For validating the novel planning problem, the chapter has taken recourse to simulated annealing (SA) and a well cited meta-heuristic H-II. The authors have also presented comparison of the performances of SA and H-II with a variant of distance based planning (DBP) scheme in this domain.

scholarly journals Reactive Path Planning Approach for Docking Robots in Unknown Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Peng Cui ◽  
Weisheng Yan ◽  
Yintao Wang
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Potential Field ◽  
Autonomous Robots ◽  
Planning Problem ◽  
Long Distance ◽  
Unknown Environment ◽  
Work Area ◽  
Planning Approach ◽  
Feasible Path

Autonomous robots need to be recharged and exchange information with the host through docking in the long-distance tasks. Therefore, feasible path is required in the docking process to guide the robot and adjust its pose. However, when there are unknown obstacles in the work area, it becomes difficult to determine the feasible path for docking. This paper presents a reactive path planning approach named Dubins-APF (DAPF) to solve the path planning problem for docking in unknown environment with obstacles. In this proposed approach the Dubins curves are combined with the designed obstacle avoidance potential field to plan the feasible path. Firstly, an initial path is planned and followed according to the configurations of the robot and the docking station. Then when the followed path is evaluated to be infeasible, the intermediate configuration is calculated as well as the replanned path based on the obstacle avoidance potential field. The robot will be navigated to the docking station with proper pose eventually via the DAPF approach. The proposed DAPF approach is efficient and does not require the prior knowledge about the environment. Simulation results are given to validate the effectiveness and feasibility of the proposed approach.

scholarly journals Human-Machine Cooperative Trajectory Planning for Semi-Autonomous Driving Based on the Understanding of Behavioral Semantics

Electronics ◽  
2021 ◽  
Vol 10 (8) ◽  
pp. 946
Author(s):  
Bohan Jiang ◽  
Xiaohui Li ◽  
Yujun Zeng ◽  
Daxue Liu
Keyword(s):  
Decision Making ◽  
Trajectory Planning ◽  
Autonomous Driving ◽  
Planning Problem ◽  
Decision Level ◽  
Planning Approach ◽  
Decision Making Problem ◽  
Generation Level ◽  
High Level ◽  
Real Vehicle

This paper presents a novel cooperative trajectory planning approach for semi-autonomous driving. The machine interacts with the driver at the decision level and the trajectory generation level. To minimize conflicts between the machine and the human, the trajectory planning problem is decomposed into a high-level behavior decision-making problem and a low-level trajectory planning problem. The approach infers the driver’s behavioral semantics according to the driving context and the driver’s input. The trajectories are generated based on the behavioral semantics and driver’s input. The feasibility of the proposed approach is validated by real vehicle experiments. The results prove that the proposed human–machine cooperative trajectory planning approach can successfully help the driver to avoid collisions while respecting the driver’s behavior.

Multi-Period Water Network Synthesis for Eco Industrial Parks considering Regeneration and Reuse

2017 ◽  
Vol 12 (3) ◽  
Author(s):  
Sumit Bishnu ◽  
Patrick Linke ◽  
Sabla Alnouri ◽  
Mahmoud El-Halwagi
Keyword(s):  
Water Reuse ◽  
Planning Horizon ◽  
Network Synthesis ◽  
Planning Problem ◽  
Treatment Unit ◽  
Freshwater Streams ◽  
Network Cost ◽  
Industrial Parks ◽  
Source To Sink ◽  
Planning Approach

Abstract A multi-period planning approach for water reuse and regeneration networks in Eco-Industrial Parks (EIPs) is presented. The objective of the optimization problem is to determine the lowest network cost design for such systems, by taking into account an entire planning horizon. A source-to-sink mapping approach has been proposed to formulate the multi-period planning problem. Water sources can either be allocated to water sinks, treatment units or discharged to environment. Freshwater streams and treated water are made available to mix with water sinks to enable reuse between plants. Waste water is allowed to be discharged into environment at threshold contaminant levels. The problem has been illustrated initially with two-stage centralized treatment unit, then by considering a hybrid treatment setup consisting of both centralized and decentralized options. The results obtained indicate considerable cost reductions, when compared to those developed separately for each individual period. Moreover, a decrease in the complexity of the water networks has also been observed, when simultaneously considering the entire planning horizon.

Telemedicine

2017 ◽  
pp. 467-481
Author(s):  
Kristian Kidholm
Keyword(s):  
Healthcare Systems ◽  
Chronic Health Conditions ◽  
Health Conditions ◽  
Self Management ◽  
Chronic Health ◽  
Demographic Challenges ◽  
Literature Reviews ◽  
Potential Benefits ◽  
Strategic Solution ◽  
Local Healthcare

This chapter describes how different types of telemedicine can be used to increase self-management of individuals with chronic health conditions. Based on a number of systematic literature reviews, the potential benefits of telemedicine for individuals with diabetes, COPD, and heart failure are presented. Because telemedicine in many countries are considered a strategic solution to the demographic challenges that the healthcare systems are facing, the chapter also includes a presentation of the model for assessment of telemedicine (MAST) framework for assessing new telemedicine solutions, as well as recommendations for outcome assessment and methods for data collection. This information is provided for the potential benefit of managers and healthcare professionals in order to determine which telemedicine services could be used by their local healthcare systems for improving self-management of individuals with chronic health conditions.

Sign in / Sign up

Export Citation Format

Share Document