Search Results for author:
Found 3 papers, 1 papers with code
MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem
However, this paper demonstrates that the methods based on DVS cannot always obtain the optimal solution.
An Efficient Approach to the Online Multi-Agent Path Finding Problem by Using Sustainable Information
The low-level solver, the Sustainable Reverse Safe Interval Path Planning algorithm (SRSIPP), is an efficient single-agent solver that uses previous planning context to reduce duplicate calculations.
Visual Subtitle Feature Enhanced Video Outline Generation
Furthermore, based on the similarity between video outlines and textual outlines, we use a large number of articles with chapter headings to pretrain our model.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
