نتایج جستجو برای: cost path
تعداد نتایج: 517377 فیلتر نتایج به سال:
An approach for the semi-automatic extraction of roads from high-resolution satellite imagery is proposed. Scale space, Edge-detection techniques are used as pre-processing for segmentation and estimation of road width. The detection of road is based on the cost minimization technique. The cost is estimated by taking various factors into consideration like variance, direction, length and width ...
We consider the multi-robot task allocation (MRTA) problem in an initially unknown environment. The objective of the MRTA problem is to find a schedule or sequence of tasks that should be performed by a set of robots so that the cost or energy expended by the robots is minimized. Existing solutions for the MRTA problem mainly concentrate on finding an efficient task allocation among robots, wit...
Worldwide Interoperability for Microwave Access (WiMAX) is the latest broadband wireless technology for terrestrial broadcast services in Metropolitan Area Networks (MANs). WiMAX has potential success in its line-of-sight (LOS) and non line-of-sight (NLOS) conditions which operating below 11 GHz frequency. Estimation of path loss is very important in initial deployment of wireless network and c...
A bicriteria network is an interlinked data set where edges are labeled with two cost attributes. An example is a road network where edges represent road segments being labeled with traversal time and energy consumption. To measure the proximity of two nodes in network data, the common method is to compute a cost optimal path between the nodes. In a bicriteria network, there often is no unique ...
This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NP-hard. Special, realistic, cases which are polynomially solvable are discussed. Dynamic shortest path problems often arise in transportation ...
Bi-directional WDM transmission is a technique that allows data to be transmitted simultaneously in both directions of a fiber, with different sets of wavelength channels for each direction. Compared with unidirectional WDM systems, it not only saves the cost of deploying extra fibers, but also allows more flexible bandwidth provisioning. To exploit this flexibility, we investigate path protect...
We propose an algorithm forfinding a multicast tree in packet-switched networks. The objective is to minimize total cost incurred at the multicast path. The routing model is based on the minimum cost Steiner tree problem The Steiner problem is extended, in our papes to incorpomte two additional requirements. First , the delay experienced along the path from the source to each destination is bou...
In energy constrained wireless sensor networks, it is significant to make full use of the limited energy and maximize the network lifetime even when facing some unexpected situation. In this paper, all sensor nodes are grouped into clusters, and for each cluster, it has a mobile cluster head to manage the whole cluster. We consider an emergent situation that one of the mobile cluster heads is b...
Motivated by what is required for real-time path planning, the paper starts out by presenting RMPD, a new recursive “local” planner founded on the key notion that, unless made necessary by an obstacle, there must be no deviation from the shortest path between any two points, which would normally be a straight line path in the configuration space. Subsequently, we increase the power of RMPD by i...
The Weighted Region Problem is defined as the problem of finding a cost-optimal path in a weighted planar polygonal subdivision. Searching for paths on a grid representation of the scene is fast and easy to implement. However, grid representations do not capture the exact geometry of the scene. Hence, grid paths can be inaccurate or might not even exist at all. Methods that work on an exact rep...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید