Yonghang Su

dblp:389/7878 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Smart cities and intelligent transportation
ridesharing
1.012026
Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing · AAAI 2026
Mathematical optimization › combinatorial optimization
assignment problem
1.012026
Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing · AAAI 2026
Mathematical optimization
combinatorial optimization
1.012026
Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing · AAAI 2026

Methods — techniques the papers use, named apart from their topics

approximation algorithm · 2.0
YearPublicationVenuePosition
2026 Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing
abstract
The Ride-Sharing Assignment Problem (AAAI 2018) is a fundamental problem in intelligent transportation systems, urban mobility, and algorithmic decision-making. Given a set of m vehicles with initial locations and n requests (n≤mk), each with a specified origin and destination, the goal is to assign at most k requests to each vehicle and compute corresponding routes that minimize the total travel distance. The algorithmic approach depends on whether n=mk or n
Jingyang Zhao 0001, Mingyu Xiao 0001, Yonghang Su
AAAI3
2024 Improvement of Small Target Detection Algorithm for UAVs
abstract
As Unmanned Aerial Vehicle (UAV) technology has developed, UAVs have gradually been used in a variety of fields such as rescue, mapping and aerial photography. At the same time, target detection and tracking algorithms have also been applied to UAVs. Considering the domain of UAV flight, the objective of this paper is to enhance the target detection algorithm utilizing YOLOv5 as its foundation. Initially, the Attentional Scale Sequence Fusion network is adopted. It is used to improve the model's feature learning and small target detection capabilities. Next, to enhance the model's spatial perception for small targets, the ordinary convolution in the feature fusion network is replaced by coordinate convolution. Ultimately, the SIoU loss function is employed with the objective of boosting the accuracy of the prediction box and accelerating the convergence speed of the model training. The enhanced target detection algorithm has led to an improvement in the mAP of 1.2%, an increase in accuracy of 1.7% and a rise in recall of 0.3%.
Yonghang Su, Lirong Yan, Yikang Zhai
CoDIT1