Path consistency is an important component of the resolution method needed to check for the consistency of an Allen’s Interval-based temporal network. While this local consistency algorithm reduces, in general, the size of the search space before applying the backtrack search, it implies the consistency of the problem for some specific temporal networks. Our goal in this paper is to maintain th...

With the prevalence of wireless video applications, QoS of wireless video transmission in resource-limited wireless networks attract more and more researchers’ attention. In network layer, how to perform video packet assignment in multipath routing is a key issue. In this paper, we develop a simple but efficient, priority based dynamic assignment algorithm for multipath routing. The idea of thi...

This paper presents an active quality of service (QoS) aware service composition protocol for mobile ad hoc networks (MANETs), with the goal of conserving resources subject to QoS requirements. A problem of QoS based service composition in MANETs is transformed into a problem of the service path discovery. We extend Dynamic Source Routing protocol to discover and compose elementary services acr...

We present methods for extracting optimal paths from motion planning roadmaps. Our system enables any combination of optimization criteria, such as collision detection, kinematic/dynamic constraints, or minimum clearance, and relaxed definitions of the goal state, to be used when selecting paths from roadmaps. Our algorithm is an augmented version of Dijkstra’s shortest path algorithm which all...

In this paper, the problem of path planning for active simultaneous localization and mapping (SLAM) is addressed. In order to improve its localization accuracy while autonomously exploring an unknown environment the robot needs to revisit positions seen before. To that end, we propose a path planning algorithm for active SLAM that continuously improves robot’s localization while moving smoothly...

In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...