The Kalman trackingalgorithm estimates position, velocity, and acceleration of a target from noisy measurement. A parallel Kalman algorithm is derived using the row-column partitioning with the modified state vector ...
详细信息
The Kalman trackingalgorithm estimates position, velocity, and acceleration of a target from noisy measurement. A parallel Kalman algorithm is derived using the row-column partitioning with the modified state vector representation for multiprocessor realization. Mapping the tasks onto the multiprocessor system to minimize the time needed to complete all the tasks is an NP hard problem, and it arises when the task dependency structure of a parallel algorithm differs from the processor interconnection topology or when the number of processes generated by the algorithm exceeds the number of processors available. The efficient mapping of 3D-3S parallel Kalman trackingalgorithm onto the network of 10 transputers, which are connected in tree structure that achieves a speedup of 6 is presented here.
In Wireless Sensor Networks (WSN) the wireless nodes work untethered and have limited power resource. Wireless charging provides an alternative approach to recharge the batteries of the wireless nodes. Localization pr...
详细信息
In Wireless Sensor Networks (WSN) the wireless nodes work untethered and have limited power resource. Wireless charging provides an alternative approach to recharge the batteries of the wireless nodes. Localization provides the position information. Previous works have considered either on recharging techniques or on the localization. This paper proposes a wireless recharging and also localization using a single mobile anchor. First the mobile anchor locates the static node later it receives the battery level. Finally if the battery of the static node is lesser than the threshold limit b, it recharges the static nodes wirelessly. Also the mobile anchor follows an energy efficient path V curve algorithm. The proposed method can handle the dynamic energy demand efficiently.
Signed directed graph (SDG), as a widely applied fault diagnosis approach, is unable to express complicated logic relations other than logic OR and usually results in spurious interpretations. To solve the problem, a ...
详细信息
Signed directed graph (SDG), as a widely applied fault diagnosis approach, is unable to express complicated logic relations other than logic OR and usually results in spurious interpretations. To solve the problem, a semiquantitative fault diagnosis approach based on the model of multilogic probabilistic SDG (MPSDG) with Bayesian inference is proposed. The MPSDG model introduces the logic gates to describe multiple logic causalities between process variables, and the priori probabilistic parameters in MPSDG are decided by the historical malfunction frequencies and the deviation of variables. When a failure occurs, the backtrackingalgorithm using the consistent rule is conducted immediately, and the posterior probabilities of each searched fault are computed and sorted by a set of Bayesian inference mechanisms. Thus, the real reason is further distinguished. This MPSDG based fault diagnosis approach is applied to two examples: a continuous stirred tank heater (CSTH) process and a Tennessee Eastman (TE) process. The experimental results demonstrate that the proposed approach is superior to the conventional SDG approach and can diagnose the production faults more accurately.
In this paper, a new heuristic algorithm is proposed for the optimum voltage control, which is applicable for the large Radial Distribution Systems (RDSs). In the RDSs, voltage levels at different buses can be maintai...
详细信息
In this paper, a new heuristic algorithm is proposed for the optimum voltage control, which is applicable for the large Radial Distribution Systems (RDSs). In the RDSs, voltage levels at different buses can be maintained within the specified limits using the conductor grading or placing the Voltage Regulators (VRs) and capacitors at suitable locations. The proposed back tracking algorithm (BTA) proposes the optimal location, number and tap positions of VRs to maintain the voltage profile within the desired limits and decreases losses in the system, which in turn maximizes the net savings in the operation of distribution system. In addition to BTA, an approach using the fuzzy logic called Fuzzy Expert System (FES) is also proposed, and the results of FES are compared with the results of BTA. This heuristic algorithm proposes the optimal location and tap setting of VRs, which contributes a smooth voltage profile along the network. It also used to access the minimum number of initially considered VRs, by moving them in such way as to control the network voltage at minimum possible cost. It is concluded that the FES also gives the optimal placement and the number along with the tap settings of VRs. The proposed FES contributes good voltage regulation, and decreases the power loss which in turn increases the net savings when compared to the BTA. The effectiveness of the proposed heuristic approaches are examined on practical 47 bus and 69 bus Radial Distribution Systems (RDSs).
The problem of recovering a sparse L-ary signal from magnitudes of its Fourier transform or equivalently its autocorrelation function is considered. Although, one can show that solving the phase retrieval problem for ...
详细信息
ISBN:
(纸本)9781479948772
The problem of recovering a sparse L-ary signal from magnitudes of its Fourier transform or equivalently its autocorrelation function is considered. Although, one can show that solving the phase retrieval problem for L-ary signals is possible in time that is polynomial in L and length of the signal, however, the current algorithms are still not practical. We introduce a backtrackingalgorithm on a tree which solves the phase retrieval problem. By simulations, we show that the average number of nodes visited on the tree by the backtrackingalgorithm grows polynomially in L and signal length, although the search tree has an exponential size.
We study stability and delay in dynamic networks under adversarial conditions. Adversarial conditions are mandatory in establishing deterministic performance guarantees in networks. Under this framework, we concentrat...
详细信息
ISBN:
(纸本)9781479960361
We study stability and delay in dynamic networks under adversarial conditions. Adversarial conditions are mandatory in establishing deterministic performance guarantees in networks. Under this framework, we concentrate on the general stability region for a network, i.e. without specifying the routing algorithm. This is in contrast to related work for adversarial network conditions, where usually the back-pressure routing algorithm is considered. Our work consists of four novel contributions: (1) We present a novel analysis model which is based on the theory of infinite two-player games;(2) Using this approach, we can characterize the stability region of networks under adversarial conditions for arbitrary routing schemes;(3) We determine conditions under which a delay bound for packet forwarding under adversarial conditions exists;(4) We provide a backtrackingalgorithm which determines in a model-checking fashion network stability. The backtrackingalgorithm is furthermore shown to reduce the computational effort significantly for practical scenarios.
This paper focuses on tracking in typical traffic monitoring scenarios with emphasis on handling occlusions caused by trees, lampposts and cables. We extend the existing tracking with Occlusion handling and Drift corr...
详细信息
ISBN:
(纸本)9781467365970
This paper focuses on tracking in typical traffic monitoring scenarios with emphasis on handling occlusions caused by trees, lampposts and cables. We extend the existing tracking with Occlusion handling and Drift correction (TROD) algorithm with a novel occlusion detection algorithm, based on measuring the changes in the object motion pattern. The motion information is extracted via frame differencing and described a the HOG descriptor. Occlusions are handled by preventing the model update and predicting the object location based on prior observations. Our proposed system clearly outperforms state-of-the-art trackingalgorithms for larger occlusions in the specific pedestrian surveillance scenario, that is, the percentage of successfully tracked objects grows with 10-15%. At the same time, for non-specific public datasets, the performance is similar to existing state-of-the-art trackingalgorithms.
The problem of autonomous tracking a ground moving target using one single unmanned aerial vehicle is studied. An integrated trackingalgorithm is proposed and it consists of a vision-based estimator and a Lyapunov ve...
详细信息
ISBN:
(纸本)9781424474264
The problem of autonomous tracking a ground moving target using one single unmanned aerial vehicle is studied. An integrated trackingalgorithm is proposed and it consists of a vision-based estimator and a Lyapunov vector field-based guidance law. The tracking trajectory converges to a circular orbit loitering around the target of arbitrary motion. Further, the proposed estimator ensures continuous tracking mission in presence of the loss-of-tracking events. The performance of the proposed trackingalgorithm is demonstrated through computer simulations.
Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting ...
详细信息
Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting point to the destination, with both vertices already given;but the researches of shortest path on a limited time and limited nodes passing through are few, yet such problem could not be more common in real life. In this paper we propose several time-dependent optimization algorithms for this problem. In regard to traditional backtracking and different node compression methods, we first propose an improved backtrackingalgorithm for one condition in big data environment and three types of optimization algorithms based on node compression involving large data, in order to realize the path selection from the starting point through a given set of nodes to reach the end within a limited time. Consequently, problems involving different data volume and complexity of network structure can be solved with the appropriate algorithm adopted.
Generator start-up sequence is critical to power system restoration. A new algorithm to optimize the start-up sequence of generators based on Dijkstra method is proposed in this paper. First, a combined weight is prop...
详细信息
ISBN:
(纸本)9781479913022
Generator start-up sequence is critical to power system restoration. A new algorithm to optimize the start-up sequence of generators based on Dijkstra method is proposed in this paper. First, a combined weight is proposed for the Dijkstra method to balance various optimization objects. Based on the modified weights, a priority index considering the branch weight, generator start-up requirement and ramping rate is proposed to optimize the generator start-up sequence. Second, we analyze the backtrackingalgorithm in detail and found its limitation and disadvantages, which leads a large amount of calculation and start-up failure. A new algorithm to calculate the start-up sequence is proposed. It can avoid the repetition calculation of Dijkstra and reduce the computation cost by avoiding backtracking. Finally, the IEEE 30-Bus system and Guangdong power grid system are used to validate the proposed algorithm. Simulation results show that the proposed method is efficiency and it can decrease the restoration time significantly.
暂无评论