اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSearching k-Optimal Goals for an Orienteering Problem on a Specialized Graph with Budget Constraints
120
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a novel non-randomized anytime orienteering algorithm for finding k-optimal goals that maximize reward on a specialized graph with budget constraints. This specialized graph represents a real-world scenario which is analogous to an orienteering problem of finding k-most optimal goal states.
قيم البحث
اقرأ أيضاً
Recently, several studies have explored the use of neural network to solve different routing problems, which is an auspicious direction. These studies usually design an encoder-decoder based framework that uses encoder embeddings of nodes and the pro
blem-specific context to produce node sequence(path), and further optimize the produced result on top by beam search. However, existing models can only support node coordinates as input, ignore the self-referential property of the studied routing problems, and lack the consideration about the low reliability in the initial stage of node selection, thus are hard to be applied in real-world. In this paper, we take the orienteering problem as an example to tackle these limitations. We propose a novel combination of a variant beam search algorithm and a learned heuristic for solving the general orienteering problem. We acquire the heuristic with an attention network that takes the distances among nodes as input, and learn it via a reinforcement learning framework. The empirical studies show that our method can surpass a wide range of baselines and achieve results close to the optimal or highly specialized approach. Also, our proposed framework can be easily applied to other routing problems. Our code is publicly available.
A benchmark for multi-UAV task assignment is presented in order to evaluate different algorithms. An extended Team Orienteering Problem is modeled for a kind of multi-UAV task assignment problem. Three intelligent algorithms, i.e., Genetic Algorithm,
Ant Colony Optimization and Particle Swarm Optimization are implemented to solve the problem. A series of experiments with different settings are conducted to evaluate three algorithms. The modeled problem and the evaluation results constitute a benchmark, which can be used to evaluate other algorithms used for multi-UAV task assignment problems.
Code retrieval is to find the code snippet from a large corpus of source code repositories that highly matches the query of natural language description. Recent work mainly uses natural language processing techniques to process both query texts (i.e.
, human natural language) and code snippets (i.e., machine programming language), however neglecting the deep structured features of query texts and source codes, both of which contain rich semantic information. In this paper, we propose an end-to-end deep graph matching and searching (DGMS) model based on graph neural networks for the task of semantic code retrieval. To this end, we first represent both natural language query texts and programming language code snippets with the unified graph-structured data, and then use the proposed graph matching and searching model to retrieve the best matching code snippet. In particular, DGMS not only captures more structural information for individual query texts or code snippets but also learns the fine-grained similarity between them by cross-attention based semantic matching operations. We evaluate the proposed DGMS model on two public code retrieval datasets with two representative programming languages (i.e., Java and Python). Experiment results demonstrate that DGMS significantly outperforms state-of-the-art baseline models by a large margin on both datasets. Moreover, our extensive ablation studies systematically investigate and illustrate the impact of each part of DGMS.
This article treats optimal sparse control problems with multiple constraints defined at intermediate points of the time domain. For such problems with intermediate constraints, we first establish a new Pontryagin maximum principle that provides firs
t order necessary conditions for optimality in such problems. Then we announce and employ a new numerical algorithm to arrive at, in a computationally tractable fashion, optimal state-action trajectories from the necessary conditions given by our maximum principle. Several detailed illustrative examples are included.
Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs $(N, unlhd)$. A job $j in N$ is available for scheduling, if all jobs $i in N$ with $i unlhd j$ are completed. Furt
her, each job $j in N$ is assigned real valued costs $c_{j}$, which can be negative or positive. A schedule is an ordering $j_{1}, dots, j_{vert N vert}$ of all jobs in $N$. The budget of a schedule is the external investment needed to complete all jobs, i.e., it is $max_{l in {0, dots, vert N vert } } sum_{1 le k le l} c_{j_{k}}$. The goal is to find a schedule with minimum budget. Rafiey et al. (2015) showed that Budget Minimization is NP-hard following from a reduction from a molecular folding problem. We extend this result and prove that it is NP-hard to $alpha(N)$-approximate the minimum budget even on bipartite partial orders. We present structural insights that lead to arguably simpler algorithms and extensions of the results by Rafiey et al. (2015). In particular, we show that there always exists an optimal solution that partitions the set of jobs and schedules each subset independently of the other jobs. We use this structural insight to derive polynomial-time algorithms that solve the problem to optimality on series-parallel and convex bipartite partial orders.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
