Pasi Fränti

Prof. Pasi Fränti

School of Computing, University of Eastern Finland, Box 111, FIN-80101 Joensuu, Finland
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 July 2018 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
Pasi FräntiPasi Fränti
Pasi Fränti
SSSami Sieranoja
Sami Sieranoja

1 September 2019 in Pattern Recognition
Verified
Journal Article
Open access
Pasi FräntiPasi Fränti
Pasi Fränti
SSSami Sieranoja
Sami Sieranoja

25 November 2021 in Journal of Intelligent Manufacturing
Verified
Journal Article
Open access
PDF file
CZChengmin Zhou
Chengmin Zhou
BHBingding Huang
Bingding Huang
Pasi FräntiPasi Fränti
Pasi Fränti
Principles of typical motion planning algorithms are investigated and analyzed in this paper. These algorithms include traditional planning algorithms, classical machine learning algorithms, optimal value reinforcement learning, and policy gradient reinforcement learning. Traditional planning algorithms investigated includegraph search algorithms,sampling-based algorithms,interpolating curve algorithms, andreaction-based algorithms. Classical machine learning algorithms includemulticlass support vector machine,long short-term memory,Monte-Carlo tree searchandconvolutional neural network. Optimal value reinforcement learning algorithms includeQ learning,deep Q-learning network,double deep Q-learning network,dueling deep Q-learning network. Policy gradient algorithms includepolicy gradient method,actor-critic algorithm,asynchronous advantage actor-critic,advantage actor-critic,deterministic policy gradient,deep deterministic policy gradient,trust region policy optimizationandproximal policy optimization. New general criteria are also introduced to evaluate the performance and application of motion planning algorithms by analytical comparisons. The convergence speed and stability of optimal value and policy gradient algorithms are specially analyzed. Future directions are presented analytically according to principles and analytical comparisons of motion planning algorithms. This paper provides researchers with a clear and comprehensive understanding about advantages, disadvantages, relationships, and future of motion planning algorithms in robots, and paves ways for better motion planning algorithms in academia, engineering, and manufacturing.

10 February 2023 in Pattern Recognition Letters
Verified
Journal Article
Open access
Pasi FräntiPasi Fränti
Pasi Fränti
RMRadu Mariescu-Istodor
Radu Mariescu-Istodor

14 October 2020 in IEEE Transactions on Affective Computing
Verified
Journal Article
Open access
JYJiawei Yang
Jiawei Yang
GCGulraiz Iqbal Choudhary
Gulraiz Iqbal Choudhary
SRSusanto Rahardja
Susanto Rahardja
Pasi FräntiPasi Fränti
Pasi Fränti
Classification of interbeat interval time-series which fluctuates in an irregular and complex manner is very challenging. Typically, entropy methods are employed to quantify the complexity of the time-series for classifying. Traditional entropy methods focus on the frequency distribution of all the observations in a time-series. This requires a relatively long time-series with at least a couple of thousands of data points, which limits their usages in practical applications. The methods are also sensitive to the parameter settings. In this paper, we propose a conceptually new approach called attention entropy, which pays attention only to the key observations. Instead of counting the frequency of all observations, it analyzes the frequency distribution of the intervals between the key observations in a time-series. The advantages of the attention entropy are that it does not need any parameter to tune, is robust to the time-series length, and requires only linear time to compute. Experiments show that it outperforms fourteen state-of-the-art entropy methods evaluated by real-world datasets. It achieves average classification accuracy of AUC=0.71 while the second-best method, multiscale entropy, achieves AUC=0.62 when classifying four groups of people with a time-series length of 100.

1 December 2019 in Pattern Recognition Letters
Verified
Journal Article
Open access
SSSami Sieranoja
Sami Sieranoja
Pasi FräntiPasi Fränti
Pasi Fränti