نتایج جستجو برای: dynamic key path discovery algorithm

تعداد نتایج: 1794713  

Journal: :مهندسی بیوسیستم ایران 0
سعید مینایی دانشیار گروه مکانیک ماشین‏های کشاورزی، دانشگاه تربیت مدرس علیرضا مهدویان دانشجوی دکتری گروه مکانیک ماشین‏های کشاورزی، دانشگاه تربیت مدرس احمد بناکار استادیار گروه مکانیک ماشین‏های کشاورزی، دانشگاه تربیت مدرس

one of the best applications of automated navigation systems is the use of automatic steering systems in agricultural vehicles. in this research, a machine vision algorithm was designed, based on image acquisition from a camera mounted on front of acombine harvester cab fordetection of its forward path. after filtration and optimization of the image, hough transform was utilized for extracting ...

Journal: :JACIII 2008
Gim Hee Lee Marcelo H. Ang

Global path planning algorithms are good in planning an optimal path in a known environment, but would fail in an unknown environment and when reacting to dynamic and unforeseen obstacles. Conversely, local navigation algorithms perform well in reacting to dynamic and unforeseen obstacles but are susceptible to local minima failures. A hybrid integration of both the global path planning and loc...

2005
Li Liu Zhong Zhou Wei Wu

In AegisGrid, a special Architecture of Service Organization is required to organize large-scale services. According to the characteristics of AegisGrid, this paper provides a layered architecture of service organization, AGSOA, solving the key problems in large-scale services’ architecture. It also describes the method of classification of services. Methods and critical algorithm are provided ...

2012
Eddy Caron Florent Chuffart Anissa Lamani Franck Petit

Ability to find and get services is a key requirement in the development of large-scale distributed systems. We consider dynamic and unstable environments, namely Peer-to-Peer (P2P) systems. In previous work, we designed a service discovery solution called Distributed Lexicographic Placement Table (DLPT), based on a hierarchical overlay structure. A self-stabilizing version was given using the ...

Journal: :CoRR 2012
S. Sobana S. Krishna Prabha

Multi cast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes, Generally sensor networks and MANETs uses multicast algorithms which are designed to be energy efficient and to achieve optimal route discovery among mobile nodes whereas wireless mesh networks needs to maximize throughput. Here we propose two multicast...

2016
Zhiqiang Xie Xia Shao Yu Xin

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the s...

2005
Fu Peng

It is very difficult to find feasible QoS (Quality of service) routes in the mobile ad hoc networks (MANETs), because of the nature constrains of it, such as dynamic network topology, wireless communication link and limited process capability of nodes. In order to reduce average cost in flooding path discovery scheme of the traditional MANETs routing protocols and increase the probability of su...

2003
Narendra K. Singhal Biswanath Mukherjee

In this paper, we investigate new algorithms for efficiently establishing a multicast session in a mesh network while protecting the session from a link failure, e.g., a fiber cut in an optical network. First, we study these algorithms for protecting a multicast tree in a mesh network and then extend them for dynamic provisioning of survivable multicast connections where connections come and go...

2006
SHOHEI KAMEDA MASAYUKI YAMAMURA

In proportion to the rapid development of information technology, time series are today accumulated in finance, medicine, industry and so forth. Therefore, an analysis of them is an urgent need for these applications. As solving these problems clustering time series has much been paid attention. The similarity for the clustering is commonly measured with Euclidean distance and dynamic time warp...

2009
Marija Seder Ivan Petrovic

The paper presents a new path planning and replanning algorithm based on two-dimensional occupancy grid map of the environment, which integrates the focused D* (FD*) algorithm and Witkowski’s algorithm. The FD* algorithm is used for fast replanning and Witkowski’s algorithm is used for generating all optimal paths in the grid map. Our algorithm finds the shortest path in the geometrical space b...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید