CiNii Articles - Shortest path

1

Diagonal Node-based Path Planning and Path Smoothing for First Responders and Rescue Robots

Heo Shin Nyeong , Xu Erxiang , Lee Hee-Hyol

… Therefore, path planning for the first responders and rescue robots are needed the during dangerous area searching using UAVs. … Here, path planning algorithms for the first responders and rescue robots are needed to global path planning and it is better to use different kinds of node-based algorithms depending on a known and a partially known environment. …

IEEJ Transactions on Electronics, Information and Systems 141(2), 179-192, 2021

J-STAGE
2

Chip test pattern reordering method using adaptive test to reduce cost for testing of ICs

Song Tai , Liang Huaguo , Huang Zhengfeng , Ni Tianming , Sun Ying

… In this paper, we propose a novel adaptive test strategy to reduce test costs without increasing test escape, and using shortest path first (SPF) algorithm combined with K-Nearest Neighbor (KNN) to reorder the test patterns. …

IEICE Electronics Express 18(2), 20200420-20200420, 2021

J-STAGE
3

An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs

Hirotoshi Honma , Yoko Nakajima , Shigeru Masuyama

… The distance δG(x, y) is defined as the length of the shortest path between vertices x and y in G. … Let U be a set consisting of all hinge vertices of G, and let AVS(u) denote the set of pairs of vertices (x, y)s to which a path between x and y becomes longer after removal of a hinge vertex u from G. … The distance δG(x, y) is defined as the length of the shortest path between vertices x and y in G. …

情報処理学会論文誌 61(12), 2020-12-15

IPSJ
4

Method for Deriving Evacuation Routes Considering Disaster Risk

Nagi Yoshitsugu , Shinya Abe , Kayoko Yamamoto

… General path-finding methods determine a single shortest route to one end point; … General path-finding methods determine a single shortest route to one end point; …

情報処理学会論文誌 61(12), 2020-12-15

IPSJ
5

OT-based Graph Similarity using Shortest-path Length

方鐘熙 , 黄健明 , 笠井裕之

映像情報メディア学会技術報告 = ITE technical report 44(30), 19-23, 2020-11
6

On the Optimality of Shortest-path Routing in Information-Centric Networking

Ryo Nakamura , Hiroyuki Ohsaki

… A straightforward approach for content routing in ICNs is to utilize a class of shortest-path routing mechanisms. … Hence, it has been still unclear how the shortest-path routing is effective (or ineffective) in terms of application-level performance metrics. … In this paper, we try to answer research questions regarding the optimality of the shortest-path routing. …

情報処理学会論文誌 61(9), 2020-09-15

IPSJ
7

The brain-derived neurotrophic factor Val66Met polymorphism increases segregation of structural correlation networks in healthy adult brains

Ueda Issei , Takemoto Kazuhiro , Watanabe Keita , Sugimoto Koichiro , Ikenouchi Atsuko , Kakeda Shingo , Katsuki Asuka , Yoshimura Reiji , Korogi Yukunori

… Average shortest path lengths (a measure of integration), average local clustering coefficient (another measure of network segregation), small-worldness (a balance between integration and segregation), and modularity (a representative measure for modular architecture) were not significantly different between group (permutation p-values ≧ 0.01). …

PeerJ (8), e9632-1-e9632-24, 2020-08-05

IR
8

A Hybrid Deep Learning Model for Protein-Protein Interactions Extraction from Biomedical Literature

Quan Changqin , Luo Zhiwei , Wang Song

… Pretrained word embedding and shortest dependency path (SDP) embedding are fed into a two-embedding channel model, such that the model is able to model long-distance contextual information and can capture the local features and structure information effectively. …

Applied Sciences 10(8), 2690, 2020-04

IR
9

Load-Balancing Routing with Hybrid Network Considering Bandwidth Ratio

NISHIMURA Kakushin , Kakushin Nishimura , Habibullah Babakarkhail , Kenya Sato

… 提案手法とOSPFv2(Open Shortest Path First Version2)を評価し、提案手法が優れたスループットとパケット損失率であることを示した。 …

同志社大学ハリス理化学研究報告 = The Harris science review of Doshisha University 61(1), 14-21, 2020-04

IR DOI
10

Pose-based Shot Detection in a Badminton Doubles Competition Video [in Japanese]

山岸哲 , 山本佳輝 , 道満恵介 , 目加田慶人

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(454), 199-203, 2020-03-05
11

Pose-based Shot Detection in a Badminton Doubles Competition Video [in Japanese]

山岸哲 , 山本佳輝 , 道満恵介 , 目加田慶人

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(457), 199-203, 2020-03-05
12

Path Finding of Autonomous Wheel Robot by Reinforcement Learning

はふぃやんだらざん , 牛田裕斗 , 佐久間拓人 , 加藤昇平

… The mobile robot has to avoid any obstacles while finding the shortest path to a goal point, in this case, an employee. …

第82回全国大会講演論文集 2020(1), 573-574, 2020-02-20

IPSJ
13

Design and Performance Evaluation of Hexagonal Topology Networks with Novel Routing Algorithms

Yuh Jiuh Cheng , Bor-Tauo Chen , Wen-Lin Cheng

IEICE Proceeding Series (62), 310-313, 2020

DOI
14

PEDESTRIAN BEHAVIOR CHARACTERISTICS EXTRACTED BY ACTIVITY MONITORING SURVEY IN UNIVERSITY CAMPUS SQUARE [in Japanese]

OSARAGI Toshihiro , YAMADA Yuriko , KANEKO Hiroyuki

… The estimated parameters of each model showed that the floor area of canteen has a strong effect when selecting a canteen, the positional relationship with the shortest path affects the choice of staying place, and that the resistance of walking distance is affecting route choice. …

Journal of Architecture and Planning (Transactions of AIJ) 85(778), 2591-2599, 2020

J-STAGE
15

MATHEMATICAL MODEL FOR ROUTE GUIDANCE—DEVELOPING A GUIDE SIGN LOCATION AND ROUTING PROBLEM— [in Japanese]

Yao Yusaku , Tanaka Ken-ichi

旅行などで初めて訪れる場所では，何らかの方法で目的地までの道のりに関する情報を得る必要がある．道案内には，案内板やアクセスマップのようにあらかじめ決定された経路を案内するものと，カーナビゲーションシステムや地図アプリケーションのように動的に経路を決定して案内するものがある．本稿では，前者の案内板や大規模イベント時の誘導員などによる情報提供場所を決定するための問題を提案し，この問題 …

Transactions of the Operations Research Society of Japan 63(0), 18-37, 2020

J-STAGE
16

An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs

Honma Hirotoshi , Nakajima Yoko , Masuyama Shigeru

… The distance δG(x, y) is defined as the length of the shortest path between vertices x … be a set consisting of all hinge vertices of G, and let AVS(u) denote the set of pairs of vertices (x, y)s to which a path between x …

Journal of Information Processing 28(0), 1047-1051, 2020

J-STAGE
17

Method for Deriving Evacuation Routes Considering Disaster Risk

Yoshitsugu Nagi , Abe Shinya , Yamamoto Kayoko

… General path-finding methods determine a single shortest route to one end point; …

Journal of Information Processing 28(0), 1065-1072, 2020

J-STAGE
18

Application Mapping and Scheduling of Uncertain Communication Patterns onto Non-Random and Random Network Topologies

HU Yao , KOIBUCHI Michihiro

… and average shortest path length (ASPL). …

IEICE Transactions on Information and Systems E103.D(12), 2480-2493, 2020

J-STAGE
19

Traffic-Independent Multi-Path Routing for High-Throughput Data Center Networks

KAWANO Ryuta , YASUDO Ryota , MATSUTANI Hiroki , KOIBUCHI Michihiro , AMANO Hideharu

… For irregular networks, a multi-path routing method called k-shortest path routing is conventionally utilized. … However, it cannot efficiently exploit longer-than-shortest paths that would be detour paths to avoid bottlenecks. … In this work, a novel routing method called k-optimized path routing to achieve high throughput is proposed for irregular networks. …

IEICE Transactions on Information and Systems E103.D(12), 2471-2479, 2020

J-STAGE
20

Route selection of an ambulance considering the disease or injury of a patient [in Japanese]

ONO Takahiko , YOSHIMURA Soichiro , SHIMIZU Yuki

… For the reference sake, the real routes of the ambulance recorded in Hiroshima City and the shortest routes obtained by Google Maps Navigation are also presented and compared to each other. …

Transactions of the JSME (in Japanese) 86(891), 20-00223-20-00223, 2020

J-STAGE

Search Results 1-20 of 1326

Related Authors

Related Journals