Mapping technological innovation dynamics in artificial intelligence domains: Evidence from a global patent analysis

Artificial intelligence (AI) is emerging as a technology at the center of many political, economic, and societal debates. This paper formulates a new AI patent search strategy and applies this to provide a landscape analysis of AI innovation dynamics and technology evolution. The paper uses patent analyses, network analyses, and source path link count algorithms to examine AI spatial and temporal trends, cooperation features, cross-organization knowledge flow and technological routes. Results indicate a growing yet concentrated, non-collaborative and multi-path development and protection profile for AI patenting, with cross-organization knowledge flows based mainly on interorganizational knowledge citation links.

Origin–Destination Flow Estimation from Link Count Data Only

All established models in transportation engineering that estimate the numbers of trips between origins and destinations from vehicle counts use some form of a priori knowledge of the traffic. This paper, in contrast, presents a new origin–destination flow estimation model that uses only vehicle counts observed by traffic count sensors; it requires neither historical origin–destination trip data for the estimation nor any assumed distribution of flow. This approach utilises a method of statistical origin–destination flow estimation in computer networks, and transfers the principles to the domain of road traffic by applying transport-geographic constraints in order to keep traffic embedded in physical space. Being purely stochastic, our model overcomes the conceptual weaknesses of the existing models, and additionally estimates travel times of individual vehicles. The model has been implemented in a real-world road network in the city of Melbourne, Australia. The model was validated with simulated data and real-world observations from two different data sources. The validation results show that all the origin–destination flows were estimated with a good accuracy score using link count data only. Additionally, the estimated travel times by the model were close approximations to the observed travel times in the real world.

Better estimation of origin–destination matrix using automated intersection movement count data

Intersection movements carry more disaggregate information about origin–destination (O–D) flows than link counts in a traffic network. In this paper, a mathematical formulation is presented for O–D matrix estimation using intersection counts, which is based on an existing linear programming model employing link counts. The proposed model estimates static O–D flows for uncongested networks assuming no a priori information on the O–D matrix. Both models were tested in two hypothetical networks previously used in O–D matrix studies to monitor their performances assuming various numbers of count location and measurement errors. Two new measures were proposed to evaluate the model characteristics of O–D flow estimation using traffic counts. While both link count based and intersection count based models performed with the same success under complete data collection assumption, intersection count based formulation estimated the O–D flows more successfully under decreasing number of observation locations. Also, the results of the 30 measurement error scenarios revealed that it performs more robustly than the link count based one; thus, it better estimates the O–D flows.