Tatsuya Iwase

dblp:61/9329 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Artificial intelligence
1 paper
Multi-agent systems · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Smart cities and intelligent transportation · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems
distributed constraint optimization
0.612022
A Polynomial-time Decentralised Algorithm for Coordinated Management of Multiple Intersections · IJCAI 2022
Smart cities and intelligent transportation › traffic control
autonomous intersection management
0.212022
A Polynomial-time Decentralised Algorithm for Coordinated Management of Multiple Intersections · IJCAI 2022
Smart cities and intelligent transportation
ridesharing
0.112021
A Polynomial-time, Truthful, Individually Rational and Budget Balanced Ridesharing Mechanism · IJCAI 2021

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

utility design · 1.1distributed constraint optimization · 1.1vickrey-clarke-groves · 1.0mechanism design · 1.0
YearPublicationVenuePosition
2022 A Polynomial-time Decentralised Algorithm for Coordinated Management of Multiple Intersections
abstract
Autonomous intersection management has the potential to reduce road traffic congestion and energy consumption. To realize this potential, efficient algorithms are needed. However, most existing studies locally optimize one intersection at a time, and this can cause negative externalities on the traffic network as a whole. Here, we focus on coordinating multiple intersections, and formulate the problem as a distributed constraint optimisation problem (DCOP). We consider three utility design approaches that trade off efficiency and fairness. Our polynomial-time algorithm for coordinating multiple intersections reduces the traffic delay by about 41 percentage points compared to independent single intersection management approaches.
Tatsuya Iwase, Sebastian Stein 0001, Enrico H. Gerding, Archie Chapman
IJCAI1
2021 A Polynomial-time, Truthful, Individually Rational and Budget Balanced Ridesharing Mechanism
abstract
Ridesharing has great potential to improve transportation efficiency while reducing congestion and pollution. To realize this potential, mechanisms are needed that allocate vehicles optimally and provide the right incentives to riders. However, many existing approaches consider restricted settings (e.g., only one rider per vehicle or a common origin for all riders). Moreover, naive applications of standard approaches, such as the Vickrey-Clarke-Groves or greedy mechanisms, cannot achieve a polynomial-time, truthful, individually rational and budget balanced mechanism. To address this, we formulate a general ridesharing problem and apply mechanism design to develop a novel mechanism which satisfies all four properties and whose social cost is within 8.6% of the optimal on average.
Tatsuya Iwase, Sebastian Stein 0001, Enrico H. Gerding
IJCAI1
2013 Infra-free indoor positioning using only smartphone sensors
abstract
Though a variety of indoor positioning systems have been proposed for a GPS-denied environment, most of them depend on dedicated devices which must be installed in a building. The preparation of this infrastructure usually entails considerable cost, which prevents the spread of indoor positioning technology. On the other hand, smartphones are already widespread and their low cost sensors are promising as rich data sources that can be used for indoor navigation. Several studies have demonstrated the possibility of smartphone-based infrastructure-free positioning. However, this navigation is not yet practical because of the accumulative error of inertial sensors and the communication range measurement error. We propose a solution to reduce the accumulative error of pedestrian dead reckoning carried out with only the low cost sensors and WiFi in smartphones by realizing cooperative positioning among multiple pedestrians. Our proposed method introduces linkage structures to simplify trajectories of pedestrians; these structures work as a constraint to reduce the number of variables to be estimated. Since this constraint makes positioning problems solvable with a small number of observations, our proposed method screened WiFi data by the signal strength and selected only strong signals for use in positioning. Our testing results showed that the positioning accuracy improved as the number of participants in the cooperative positioning operation increased. The positioning uncertainty was a few meters, comparable to GPS, when the density of participants is high enough.
Tatsuya Iwase, Ryosuke Shibasaki
IPIN1
1998 Pacing spoken directions to suit the listener
abstract
On the basis of corpus analysis, we havemade directiongiving dialog system which adjust the pace of dialog without using speech recognition. And we evaluate the naturalness of the resulting conversations by experiments. Then the system showed good performance. And also the possibility of prosody to compensate for the weak points of speech recognition. 1
Tatsuya Iwase, Nigel Ward
ICSLP1