Near-term large quantum computers are not able to operate as a single processing unit. It is therefore required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit. This a...
详细信息
In this work, adaptive dynamic programming (ADP) is introduced to solve the tracking control problems of unmanned underwater vehicle (UUV). Two unmanned underwater vehicle model are considered. One is without model un...
详细信息
ISBN:
(数字)9781728143231
ISBN:
(纸本)9781728143248
In this work, adaptive dynamic programming (ADP) is introduced to solve the tracking control problems of unmanned underwater vehicle (UUV). Two unmanned underwater vehicle model are considered. One is without model uncertainties and the other is with model uncertainties. The switched error tracking systems is constructed based on the desired model. The ADP controller is constructed by a single critic neural network. The simulation results show that the overall systems achieve better tracking performance.
Optimization methods generally do not fall into the most suitable algorithms for parallelization on a GPU. However, a relatively good efficiency still can be obtained if the method is properly adapted to the GPU progr...
详细信息
Optimization methods generally do not fall into the most suitable algorithms for parallelization on a GPU. However, a relatively good efficiency still can be obtained if the method is properly adapted to the GPU programming model, which is the case for dynamic programming. In this article, we propose a parallelization strategy for thread grouping for dynamic programming in CUDA. We show that parametrizing the solver parallelism according to the hardware allows better performance. The strategy provides good acceleration compared to a standard GPU parallel strategy on a dynamic programming-based implementation of the knapsack problem. We show this strategy is helpful in the case of the multi-dimensional knapsack problem, where computing multi-dimensional indices is a costly operation.
An algorithm for optical flow detection is introduced. It is based on an iterative search for a displacement field that minimizes the L/sub 1/ or L/sub 2/ distance between two images. Both changes are sliced into para...
详细信息
An algorithm for optical flow detection is introduced. It is based on an iterative search for a displacement field that minimizes the L/sub 1/ or L/sub 2/ distance between two images. Both changes are sliced into parallel and overlapping strips. Corresponding strips are aligned using dynamic programming. Two passes are performed using orthogonal slicing directions. This process is iterated in a pyramidal fashion by reducing the spacing and width of the strips. This algorithm provides very-high-quality matching for calibrated patterns as well as for human visual sensation. The results appear to be at least as good as those obtained with classical optical flow detection methods.< >
A system is described which allows the mapping of a phonetic transcription onto an acoustic parameter representation of continuous speech. Linear prediction analysis, segmentation and formant tracking provide the acou...
详细信息
A system is described which allows the mapping of a phonetic transcription onto an acoustic parameter representation of continuous speech. Linear prediction analysis, segmentation and formant tracking provide the acoustic parameters on a 5 ms time frame basis and a sequence of voiced, unvoiced and silent segments. The given phonetic transcription is expanded to include implicit phone sequences and transitions. Labelling is then performed in two stages. Segment labelling maps substrings of the expanded phone string onto the acoustic segments using a dynamic programming algorithm. The acoustic and phonetic units are correlated directly by means of a table of acoustic-phonetic rules. Frame labelling labels each time frame with a single phone using another dynamic programming algorithm based on the derivatives of energy and formant functions. The method is found to objectify and considerably facilitate the establishment of a time-locked acoustic-phonetic database.
Nowadays, many people depend on the guidance provided by car navigation devices to travel to the destination. Generally, several routes are possible for a given origin-destination (OD) in a road network. Often car nav...
详细信息
Nowadays, many people depend on the guidance provided by car navigation devices to travel to the destination. Generally, several routes are possible for a given origin-destination (OD) in a road network. Often car navigation devices provide the minimum traveling time or distance route. However, this route may not always be comfortable for users to follow. Out of the several available routes, users may prefer to travel on a certain route depending on their preferences. In this paper, we propose a Q value-based dynamic programming with Evolving Penalties to find the user preferred optimal route. In the proposed method, we consider multiple criteria and take users' preferences for them. The users' preferences are used to determine the penalty values for the criteria, which are represented as the individuals of Genetic Algorithm. In the training phase, GA population is used for the evolution of penalty values of the criteria. The values obtained from the best individual is stored and used in the route search. The algorithm was applied to the road network of Fukuoka prefecture and results show that we can find the route considering users' preferences.
In this paper, a dynamic programming (DP) based approach is proposed to split a freehand stroke into the optimal number of line segments and elliptical arcs. Different from existing DP approaches, which often require ...
详细信息
In this paper, a dynamic programming (DP) based approach is proposed to split a freehand stroke into the optimal number of line segments and elliptical arcs. Different from existing DP approaches, which often require a predefined fixed number and/or the templates of the result segments, our approach is actually a generic parameterized framework, which can be configured to some existing methods by fixing some of the parameters. Our key contributions is to avoid presetting of the number or templates of the segments and achieve the best tradeoff between the segment number and approximate error by using a suitable penalty function. Experiments show that our approach achieves high segmentation accuracy and can response to user's stroke input in real-time.
作者：
F. R. VieraJ. Toledo H.Member
IEEE PDVSA Lagoven S.A.. Member
IEEE CVG. EDELCA in Construction Division of hydroelectric Project Caruachi of Caroní River development
In this paper the dynamic programming application on optimal tower spotting location such as is formulated in (Mitra, G and Wolfende, 1968) is reformulated. Results based on this reformulation and corresponding algori...
详细信息
In this paper the dynamic programming application on optimal tower spotting location such as is formulated in (Mitra, G and Wolfende, 1968) is reformulated. Results based on this reformulation and corresponding algorithm and computer program are presented. dynamic programming consist in segmenting the route profile, defining sites, and finding optimal transmission line from start of profile to each site progressively. Stages are the sites and the optimal policy will be the line of minimal cost thru each heights of tower that support conductor. Reformulation refers to redefine optimal policy to represent adequately constrains determined by 3 towers (wind span, load span, distance to mass)
The determination of 3D structure from images is one of the most active field in computer vision. This paper gives a contribution presenting a symmetric stereo matching algorithm, based on a bidirectional dynamic prog...
详细信息
The determination of 3D structure from images is one of the most active field in computer vision. This paper gives a contribution presenting a symmetric stereo matching algorithm, based on a bidirectional dynamic programming scanline optimization. Consistent matches are detected by inspecting the images scanlines with a complex exponential weighting window and then analyzing matching score map into a bidirectional optimization framework. Results are presented running the algorithm on stereo pair freely available on the Web, in order to numerically validate the performance.
An optimization method is proposed for optimal berth system expansion planning on container terminals to improve operation performance along with the growing container quantity. This planning problem is attributed to ...
详细信息
An optimization method is proposed for optimal berth system expansion planning on container terminals to improve operation performance along with the growing container quantity. This planning problem is attributed to a multi-stage decision-making problem and its solution method is divided into two parts: (1) For the decision-making sequence in the long period, dynamic programming is used to determine the total optimal plan; (2) For a given time point, nonlinear search programming combined with discrete event simulation model is used for the local optimal berth system decision. The minimum total waiting time of ships is used as the objective function of performance evaluation. Fuzzy set theory is applied to deal with the uncertainty in performance judgments made by terminal management. With a case study, the optimal decision sequence on berth system expansion plan is determined, and the validity and feasibility of the proposed method is illustrated
暂无评论